The 1-factorization conjecture for regular graphs
Statement
Let be a regular graph of even order. The 1-factorization conjecture. Every regular graph of even order with sufficiently high degree is -factorizable. Here, -factorizable means that the edge set of can be decomposed into perfect matchings. This conjecture concerns the threshold at which regular graphs admit an edge decomposition into perfect matchings; the source does not provide enough information here to determine whether it has been 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.