Fixed-size independent-set conjecture for chromatic graphs with connectivity below chromaticity
Statement
Let be an -vertex -chromatic -connected graph, and let denote the number of independent sets of size in . Fixed-size independent-set conjecture. If , , and , then
This proposes that the same extremal behavior for the number of independent sets of size 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.