ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with treewidth kk and maximum degree Delta(G)Delta(G). The treewidth–maximum degree conjecture asserts that if

Δ(G)≥k+k,\Delta(G)\geq k+\sqrt{k},

then

χ′(G)=Δ(G).\chi'(G)=\Delta(G).

The conjecture would improve the known sufficient bound Delta(G)≥2k−1Delta(G)\geq 2k-1 for graphs of treewidth k≥4k\geq 4. It is supported by the proved fractional analogue, while constructions for infinitely many kk show that the threshold cannot generally be lowered below k+⌊k⌋k+\lfloor\sqrt{k}\rfloor; the full integral statement 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.