Partite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each
h...
The approximate uniform sampling of graph realizations with a given degr...
Let D = d_1, d_2, …, d_n and F = f_1, f_2,…, f_n be two
sequences of pos...
In this paper, we exhibit an irreducible Markov chain M on the edge
k-co...
Here we prove that counting maximum matchings in planar, bipartite graph...
One of the simplest methods of generating a random graph with a given de...
Since 1997 a considerable effort has been spent to study the mixing time...