Parameterized occupancy-fraction conjecture for triangle-free graphs

Let G=(V,E)G=(V,E) be a triangle-free graph of average degree dd, let ZG(λ)Z_G(\lambda) denote its independence polynomial, and let WW be the Lambert WW-function, defined by W(x)eW(x)=xW(x)e^{W(x)}=x. Parameterized occupancy-fraction conjecture. For every λ(0,1]\lambda\in(0,1],

λZG(λ)ZG(λ)W(λd)W(2λ)d2V.\frac{\lambda Z_G'(\lambda)}{Z_G(\lambda)}\geq \frac{W(\lambda d)-W(2\lambda)}{d-2}|V|.

The paper presents this as a more general and precise restatement of the preceding occupancy-fraction conjecture, motivated by differentiating its lower-bound inequality. The supplied text gives no resolution, so the conjecture is recorded as open.

Sources & referencesView supporting material

Primary source

Pjotr Buys, Jan van den Heuvel and Ross J. Kang, “Triangle-free graphs with the fewest independent sets”, arXiv:2503.10002 (2025).

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.