← All problems

Clancy–Leake–Payne conjecture on cyclic critical groups of random graphs

7 years old · traced to

Let GG be a graph on nn vertices, and let K(G)K(G) denote its critical group. Consider the proportion of connected graphs with nn vertices whose critical group is cyclic.

Clancy–Leake–Payne conjecture. As nn tends to infinity,

lim⁡n→∞#{Connected graphs G with ∣V(G)∣=n and K(G) cyclic}2(n2)=ζ(3)−1ζ(5)−1ζ(7)−1ζ(9)−1ζ(11)−1⋯≈0.7935212.\lim_{n \to \infty} \frac{\#\{\text{Connected graphs } G \text{ with } |V(G)| = n \text{ and } K(G) \text{ cyclic}\}}{2^{\binom{n}{2}}} = \zeta(3)^{-1}\zeta(5)^{-1}\zeta(7)^{-1}\zeta(9)^{-1}\zeta(11)^{-1}\cdots \approx 0.7935212.

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

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.