Overfull conjecture
Statement
All graphs here are finite, simple and undirected. For a graph write for its vertex set, for its edge set, , and for its maximum degree. Call overfull if
Let denote the chromatic index of , i.e. the least number of colours in a proper edge colouring of ; then , and is said to be of class 1 if and of class 2 if .
For every graph on vertices with
the following two conditions are equivalent:
- ; 2. has a subgraph with and .
Record
- Added
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.