The Oberwolfach problem on which 2-regular graphs have the property that a complete graph on the same number of vertices can be decomposed…

The Oberwolfach problem on which 2-regular graphs have the property that a complete graph on the same number of vertices can be decomposed into edge-disjoint copies of the given graph.

Open the “Subgraphs” section on Wikipedia →

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