The Overfull Conjecture for graphs of maximum degree greater than one third their order
Statement
Let be a simple graph. Write for its maximum degree, and call overfull if
A graph is of Class 2 when its chromatic index satisfies .
Overfull Conjecture. Let be a graph of Class with
Then contains an overfull subgraph with .
This conjecture of Chetwynd and Hilton would make determining the chromatic index polynomial-time solvable for graphs with maximum degree greater than one third their order. It is known in several dense cases, including when and for sufficiently large graphs with for , but remains open in general.
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.