Independent-set extremal conjecture for graphs of prescribed minimum degree
Statement
Let be a graph on vertices with minimum degree at least , where and satisfy
Let denote the total number of independent sets in , and let be the complete bipartite graph with parts of sizes and .
Minimum-degree extremal conjecture. Under these hypotheses,
The paper proves the same conclusion under the stronger condition , where , and conjectures that the relationship between and can be tightened considerably. The conjectured bound remains unresolved in the source.
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.