ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. An independent set is a set of vertices containing no edge of GG, and a cover of the vertex set is a family of such sets whose union is the vertex set. Strong minimality is the dual notion to strong maximality: a cover is strongly minimal when it is no larger, in the corresponding cardinal comparison, than any alternative cover. Strongly minimal cover conjecture. Every graph has a strongly minimal cover of its vertex set by independent sets. A positive answer would yield further consequences for posets of bounded width, while the existence of such covers remains open in the stated generality.

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.