ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=G(n)G=G(n) be a sequence of simple graphs with even degree sequence d=d(n)\boldsymbol{d}=\boldsymbol{d}(n). Write dhmd_{\mathrm{hm}} for the harmonic mean degree, and let ρ(G)\rho(G) denote the residual entropy and ρ^(G)\widehat\rho(G) the Pauling estimate. Asymptotic Pauling estimate. If

dhm→∞d_{\mathrm{hm}}\to\infty

as n→∞n\to\infty, then

ρ(G)=ρ^(G)+o(1).\rho(G)=\widehat\rho(G)+o(1).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.