ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices, and let α(G)\alpha(G) denote its independence number, the maximum size of a set of pairwise nonadjacent vertices. The graph is triad-free when α(G)≤2\alpha(G)\leq 2. Clique cover conjecture for triad-free graphs. If α(G)≤2\alpha(G)\leq 2, then

cc⁡(G)≤n.\operatorname{cc}(G)\leq n.

Here cc⁡(G)\operatorname{cc}(G) is the clique cover number of GG, the minimum number of cliques whose edges cover all edges of GG. The paper notes that this would improve the known asymptotic upper bound for triad-free graphs; the claim 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.