Asymptotic Pauling estimate for residual entropy of simple graphs
Statement
Let be a sequence of simple graphs with even degree sequence . Write for the harmonic mean degree, and let denote the residual entropy and the Pauling estimate. Asymptotic Pauling estimate. If
as , then
This predicts that the Pauling heuristic becomes asymptotically exact for simple graphs when the harmonic mean degree diverges; the paper presents it as supported by evidence, while a proof is not known.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.