ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let 0<c<10<c<1 be a constant. For a graph GG, let MIS⁡(G)\operatorname{MIS}(G) denote its family of maximal independent sets, and define the family of large maximal independent sets by

MIS⁡large(G)={I∈MIS⁡(G):∣I∣≥cn}.\operatorname{MIS}_{\mathrm{large}}(G)=\{I\in\operatorname{MIS}(G): |I|\geq cn\}.

A transversal is a set of vertices meeting every member of this family. Strong conjecture. Every graph GG on nn vertices has a transversal of size o(n)o(n) for MIS⁡large(G)\operatorname{MIS}_{\mathrm{large}}(G). 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.