ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a regular graph of even order. The 1-factorization conjecture. Every regular graph of even order with sufficiently high degree is 11-factorizable. Here, 11-factorizable means that the edge set of GG 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.