Pauling residual entropy conjecture for growing-degree regular graphs
Establish that, for every sequence of regular graphs G(n) with even degree d(n) tending to infinity, the residual entropy rho(G(n)) is asymptotic to Pauling’s residual entropy estimate rho_P(G(n)), namely rho(G(n)) = rho_P(G(n)) + o(1).
References
If $G=G(n)$ is a sequence of $d$-regular graphs with even $d=d(n)\to\infty$ as $n\to\infty$, then
(G) = (G) +o(1).
— On Pauling's residual entropy estimate for regular graphs with growing degree
(2509.20671 - Hasheminezhad et al., 25 Sep 2025) in Introduction, immediately following the sentence “In this paper, we address the following conjecture”; Conjecture environment labeled “Special case of [Conjecture 2.2] for regular graphs”
A family of matching numerical examples, or a result imposing an additional relationship between vertex count $n$ and degree $d$, leaves part of this target open.
— OpenProblemBench: Benchmarking AI on Open Problems in the Foundational Theoretical Sciences
(2610.11118 - Li et al., 8 Oct 2026) in Appendix, Section “ORB-PHYS-62: Pauling's residual entropy estimate at growing degree”