ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FF be a kk-graph. A kk-graph is FF-free if it contains no copy of FF. Let Δ\Delta denote the maximum degree. F-free coloring conjecture. There is a constant cFc_F depending only on FF such that every FF-free kk-graph with maximum degree Δ\Delta has chromatic number at most

cF(Δlog⁡Δ)1/(k−1).c_F\left(\frac{\Delta}{\log \Delta}\right)^{1/(k-1)}.

This conjecture, posed in the earlier paper cited as [FM], proposes replacing the hypothesis of simplicity by the weaker hypothesis of being FF-free; the source does not state a resolution.

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.