The beta conjecture for maximal independent sets
Statement
Let be a graph on vertices, let be the size of a smallest maximal independent set, and let be the transversal number of the family of maximal independent sets. Define
Beta conjecture. For all graphs on vertices,
This is presented as a reformulation of the Bollobás–Erdős–Tuza conjecture for -hollow graphs. The paper notes that it holds trivially when , while 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.