ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a dd-regular graph with nn vertices, and let i(G)i(G) denote its number of independent sets. Alon and Kahn's conjecture. One has

i(G)≤i(Kd,d)n/(2d)=(2d+1−1)n/(2d).i(G) \leq i(K_{d,d})^{n/(2d)}=(2^{d+1}-1)^{n/(2d)}.

This formalized the proposed extremal role of a disjoint union of copies of Kd,dK_{d,d}; the conjecture was subsequently resolved by Sah, who proved the relevant upper bound.

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.