ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an nn-vertex kk-chromatic ℓ\ell-connected graph, and let it(G)i_t(G) denote the number of independent sets of size tt in GG. Fixed-size independent-set conjecture. If k≥4k \geq 4, k>ℓk>\ell, and t≥3t \geq 3, then

it(G)≤it(G∗).i_t(G) \leq i_t(G^*).

This proposes that the same extremal behavior for the number of independent sets of size tt should persist when the chromatic number exceeds the connectivity; the source presents it as an open question.

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.