Strong conjecture on transversals of large maximal independent sets
Statement
Let be a constant. For a graph , let denote its family of maximal independent sets, and define the family of large maximal independent sets by
A transversal is a set of vertices meeting every member of this family. Strong conjecture. Every graph on vertices has a transversal of size for . The source describes this as a stronger conjecture proposed tentatively, and provides no proof or counterexample; the supplied status evidence is inconsistent with the assertion and is therefore noted for review.
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.