Galvin's fixed-size independent-set conjecture for minimum-degree graphs
Statement
Let be the family of -vertex graphs with minimum degree at least , and let denote the number of independent sets of size in . For , one has
Galvin's conjecture. Except perhaps for some small values of , for every fixed and sufficiently large , the graph maximizes among -vertex graphs with minimum degree at least ; more precisely, for each there is a such that for all , , and ,
The conjecture concerns the level-by-level analogue of the known result that maximizes the total number of independent sets in this family. The case is known, with ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.