ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with no holes of length at least 55. A partition conjecture asserts that V(G)V(G) can be partitioned into two sets, neither of which contains a maximum clique of GG.

This conjecture would imply the bound chi(G)leq2omega(G)chi(G) leq 2^{omega(G)} for graphs with no holes of length at least 55. 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 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.