Parameterized occupancy-fraction conjecture for triangle-free graphs
Parameterized occupancy-fraction conjecture for triangle-free graphs
Let be a triangle-free graph of average degree , let denote its independence polynomial, and let be the Lambert -function, defined by . Parameterized occupancy-fraction conjecture. For every ,
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.