ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices, let i(G)i(G) be the size of a smallest maximal independent set, and let τ(G)\tau(G) be the transversal number of the family of maximal independent sets. Define

β(G)=τ(G)i(G)n.\beta(G)=\frac{\tau(G)i(G)}{n}.

Beta conjecture. For all graphs GG on nn vertices,

β(G)=o(n).\beta(G)=o(n).

This is presented as a reformulation of the Bollobás–Erdős–Tuza conjecture for cc-hollow graphs. The paper notes that it holds trivially when i(G)=o(n)i(G)=o(n), 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 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.