ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. For an integer ℓ≥3\ell\ge 3, call GG Cℓ+1C_{\ell+1}-free if it contains no cycle of length exactly ℓ+1\ell+1 as a, not necessarily induced, subgraph. Let KℓK_{\ell} denote the complete graph on ℓ\ell vertices, and let φ(G)\varphi(G) denote the chromatic discrepancy of GG.

Strengthened cycle-free chromatic discrepancy conjecture. For every integer ℓ≥3\ell\ge 3, every Cℓ+1C_{\ell+1}-free graph G≠KℓG\ne K_{\ell} satisfies

φ(G)≥χ(G)−ℓ+1.\varphi(G)\ge \chi(G)-\ell+1.

The source presents this as a stronger conjecture motivated by the suspicion that equality in the weaker bound occurs only when ℓ=2\ell=2 or when GG is complete. Its status is not otherwise resolved 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.