ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a K4K_4-free graph with chromatic number 44. Must GG contain an odd cycle with at least two diagonals? More generally, is there some f(r)→∞f(r)\to \infty such that every graph with chromatic number 44, in which every subgraph on ≤r\leq r vertices has chromatic number ≤3\leq 3, contains an odd cycle with at least f(r)f(r) diagonals?

Record

Added
Links

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.