The clique cover bound for triad-free graphs
Statement
Let be a graph on vertices, and let denote its independence number, the maximum size of a set of pairwise nonadjacent vertices. The graph is triad-free when . Clique cover conjecture for triad-free graphs. If , then
Here is the clique cover number of , the minimum number of cliques whose edges cover all edges of . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.