Oberwolfach problem
Statement
For an integer and integers , let
denote the vertex-disjoint union of cycles of lengths , a -regular graph on vertices. Write for the following requirement on , using exponential notation for repeated table sizes (so that, e.g., means ):
- if is odd, the edge set of the complete graph can be partitioned into subgraphs, each isomorphic to ; - if is even, the edge set of with the edges of a perfect matching removed can be partitioned into subgraphs, each isomorphic to .
For each of
no such partition exists. For every choice of and other than these four (up to reordering of the ), the required partition exists.
Record
- Added
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.