Tutte’s three-edge-coloring conjecture
Statement
Every -connected cubic graph with no Petersen-graph minor admits a proper edge-coloring with colors; equivalently, its edges can be partitioned into matchings.
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.