McKay–Wormald's asymptotic enumeration conjecture for graphs with given degree sequence
Let be a degree sequence, let denote the number of graphs with degree sequence , let , let , and let . McKay–Wormald's conjecture. For some absolute constant , if satisfies
and is even, then
References
Status
- Solved: Anita Liebenau and Nick Wormald. Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph (Journal of the European Mathematical Society, 2023) https://doi.org/10.4171/jems/1355
Source: Anita Liebenau and Nick Wormald, “Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph”, arXiv:1702.08373 (2019).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.