ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices with minimum degree at least δ\delta, where nn and δ\delta satisfy

n≥2δ.n \geq 2\delta.

Let i(G)i(G) denote the total number of independent sets in GG, and let Kδ,n−δK_{\delta,n-\delta} be the complete bipartite graph with parts of sizes δ\delta and n−δn-\delta.

Minimum-degree extremal conjecture. Under these hypotheses,

i(G)≤i(Kδ,n−δ).i(G) \leq i(K_{\delta,n-\delta}).

The paper proves the same conclusion under the stronger condition n≥(C−1)δ2+(3C−1)δ+2n\geq (C-1)\delta^2+(3C-1)\delta+2, where C=ln⁡4/(ln⁡4−1)C=\ln 4/(\ln 4-1), and conjectures that the relationship between nn and δ\delta can be tightened considerably. The conjectured bound n≥2δn\geq 2\delta remains unresolved in the source.

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.