Dirac's 1-Factorization Conjecture
Statement
Let be a graph of even order, and let be an integer. A graph is 1-factorable if its edges can be partitioned into 1-factors, equivalently if its chromatic index equals its maximum degree. 1-Factorization Conjecture. If is -regular for some
then is 1-factorable; equivalently, . The conjecture is a central dense-graph edge-coloring assertion and was verified for all sufficiently large graphs by Csaba, Kühn, Lo, Osthus, and Treglown in 2016; the supplied source does not state that the finite conjecture is completely resolved.
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.