ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G(n,δ)\mathcal{G}(n,\delta) be the family of nn-vertex graphs with minimum degree at least δ\delta, and let it(G)i_t(G) denote the number of independent sets of size tt in GG. For Kδ,n−δK_{\delta,n-\delta}, one has

it(Kδ,n−δ)=(n−δt)+(δt).i_t(K_{\delta,n-\delta})=\binom{n-\delta}{t}+\binom{\delta}{t}.

Galvin's conjecture. Except perhaps for some small values of tt, for every fixed δ\delta and sufficiently large nn, the graph Kδ,n−δK_{\delta,n-\delta} maximizes it(G)i_t(G) among nn-vertex graphs with minimum degree at least δ\delta; more precisely, for each δ≥1\delta\geq 1 there is a C(δ)C(\delta) such that for all t≥C(δ)t\geq C(\delta), n≥2δn\geq 2\delta, and G∈G(n,δ)G\in\mathcal{G}(n,\delta),

it(G)≤it(Kδ,n−δ)=(n−δt)+(δt).i_t(G)\leq i_t(K_{\delta,n-\delta})=\binom{n-\delta}{t}+\binom{\delta}{t}.

The conjecture concerns the level-by-level analogue of the known result that Kδ,n−δK_{\delta,n-\delta} maximizes the total number of independent sets in this family. The case δ=1\delta=1 is known, with C(1)=3C(1)=3; the general assertion remains open.

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.