The 1-factorization conjecture that if n is odd or even and k \geq n, n

1, respectively, then a k-regular graph with 2n vertices is 1-factorable.

Open the “Graph coloring and labeling” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)