Partition conjecture for graphs with no holes of length at least five
Statement
Let be a graph with no holes of length at least . A partition conjecture asserts that can be partitioned into two sets, neither of which contains a maximum clique of .
This conjecture would imply the bound for graphs with no holes of length at least . Hoang and McDiarmid conjectured that the same partition property holds for all odd-hole-free graphs; the status of the stated conjecture is not established in the supplied text.
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.