Hassler–Treglown conjecture on maximal independent sets in graphs with a perfect matching
Statement
Let be an -vertex graph, and let denote its number of maximal independent sets. Hassler–Treglown conjecture. If contains a perfect matching, then
The abstract states that this conjecture is resolved by the paper’s graph-theoretic bound.
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.