Uniform generation of random regular graphs of moderate degree
Journal of Algorithms
Asymptotic enumeration by degree sequence of graphs of high degree
European Journal of Combinatorics
A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
The cores of random hypergraphs with a given degree sequence
Random Structures & Algorithms
Generating random graphic sequences
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Approximate counting of regular hypergraphs
Information Processing Letters
| Hi-index | 0.01 |
Let $\mathbf{d}=d_1\leq d_2\leq\dots\leq d_n$ be a nondecreasing sequence of $n$ positive integers whose sum is even. Let $\mathcal{G}_{n,\mathbf{d}}$ denote the set of graphs with vertex set $[n]=\{1,2,\dots,n\}$ in which the degree of vertex $i$ is $d_i$. Let $G_{n,\mathbf{d}}$ be chosen uniformly at random from $\mathcal{G}_{n,\mathbf{d}}$. It will be apparent from section 4.3 that all of the sequences we are considering will be graphic. We give a condition on $\mathbf{d}$ under which we can show that whp $\mathcal{G}_{n,\mathbf{d}}$ is Hamiltonian. This condition is satisfied by graphs with exponential tails as well those with power law tails.