ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an nn-vertex graph, and let VG(λ)V_G(\lambda) denote the variance parameter of the hard-core model on GG at fugacity λ\lambda. Write KmK_m for the complete graph on mm vertices, and let Δ\Delta be the maximum degree of GG.

Davies et al.'s variance conjecture. For any λ>0\lambda>0,

VG(λ)≥VKn(λ).V_G(\lambda)\geq V_{K_n}(\lambda).

If GG has maximum degree Δ\Delta, then the stronger bound

VG(λ)≥VKΔ+1(λ)V_G(\lambda)\geq V_{K_{\Delta+1}}(\lambda)

should hold.

This conjecture proposes the complete graph as the minimizer of the variance parameter, with a sharper comparison determined by the maximum degree. The source reports it as a conjecture posed by Davies et al.; its resolution is not specified here.

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.