ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FF be a graph. A graph GG is FF-free if it contains no copy of FF; write chi(G)chi(G) for its chromatic number and let DeltaDelta be its maximum degree.

Alon–Krivelevich–Sudakov conjecture. For every graph FF, there is a constant cF>0c_F>0 such that, whenever GG is an FF-free graph of maximum degree Delta⩾2Delta\geqslant 2, one has

χ(G)⩽cFDelta/log⁡Delta.\chi(G)\leqslant c_FDelta/\log Delta.

Alon, Krivelevich, and Sudakov verified the conjecture for a class of graphs including all bipartite graphs, and subsequent work gives sharper bounds for some complete bipartite forbidden graphs. The conjecture is therefore resolved for some FF, but the general assertion 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 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.