Treewidth–maximum degree conjecture for the chromatic index
Statement
Let be a graph with treewidth and maximum degree . The treewidth–maximum degree conjecture asserts that if
then
The conjecture would improve the known sufficient bound for graphs of treewidth . It is supported by the proved fractional analogue, while constructions for infinitely many show that the threshold cannot generally be lowered below ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.