Clancy–Leake–Payne conjecture on cyclic critical groups of random graphs
Let be a graph on vertices, and let denote its critical group. Consider the proportion of connected graphs with vertices whose critical group is cyclic.
Clancy–Leake–Payne conjecture. As tends to infinity,
This conjecture gives the limiting probability that the critical group of a uniformly random graph is cyclic, a question motivated by the fact that the critical group of a graph is typically large.
References
Status
- Solved: Matthew Kwan, Ashwin Sah, and Mehtaab Sawhney. The critical group of a random graph (arXiv, 2022) https://arxiv.org/abs/2210.08526
Source: Darren Glass and Nathan Kaplan, “Chip-Firing Games and Critical Groups”, arXiv:1908.04395 (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.