Decomposition of the complete graph K 7 {\displaystyle K_{7}} into three copies of C 3 + C 4 {\displaystyle C_{3}+C_{4}}, solving the Oberwolfach problem for the input ( 3 , 4 ) {\displaystyle (3,4)}

In mathematics, the Oberwolfach problem is an open problem that may be formulated either as a problem of scheduling seating assignments for diners, or more abstractly as a problem in graph theory, on the edge cycle covers of complete graphs. It is named after the Oberwolfach Research Institute for Mathematics, where the problem was posed in 1967 by Gerhard Ringel. It is known to be true for all sufficiently large complete graphs.

Formulation

In conferences held at Oberwolfach, it is the custom for the participants to dine together in a room with circular tables, not all the same size, and with assigned seating that rearranges the participants from meal to meal. The Oberwolfach problem asks how to make a seating chart for a given set of tables so that all tables are full at each meal and all pairs of conference participants are seated next to each other exactly once. An instance of the problem can be denoted as O P ( x , y , z , … ) {\displaystyle OP(x,y,z,\dots )} where x , y , z , … {\displaystyle x,y,z,\dots } are the given table sizes. Alternatively, when some table sizes are repeated, they may be denoted using exponential notation; for instance, O P ( 5 3 ) {\displaystyle OP(5^{3})} describes an instance with three tables of size five.

Formulated as a problem in graph theory, the pairs of people sitting next to each other at a single meal can be represented as a disjoint union of cycle graphs C x + C y + C z + ⋯ {\displaystyle C_{x}+C_{y}+C_{z}+\cdots } of the specified lengths, with one cycle for each of the dining tables. This union of cycles is a 2-regular graph, and every 2-regular graph has this form. If G {\displaystyle G} is this 2-regular graph and has n {\displaystyle n} vertices, the question is whether the complete graph K n {\displaystyle K_{n}} of order n {\displaystyle n} can be represented as an edge-disjoint union of copies of G {\displaystyle G}.

In order for a solution to exist, the total number of conference participants (or equivalently, the total capacity of the tables, or the total number of vertices of the given cycle graphs) must be an odd number. For, at each meal, each participant sits next to two neighbors, so the total number of neighbors of each participant must be even, and this is only possible when the total number of participants is odd. The problem has, however, also been extended to even values of n {\displaystyle n} by asking, for those n {\displaystyle n}, whether all of the edges of the complete graph except for a perfect matching can be covered by copies of the given 2-regular graph. Like the ménage problem (a different mathematical problem involving seating arrangements of diners and tables), this variant of the problem can be formulated by supposing that the n {\displaystyle n} diners are arranged into n / 2 {\displaystyle n/2} married couples, and that the seating arrangements should place each diner next to each other diner except their own spouse exactly once.

Known results

Glock, Joos, Kim, Kühn, and Osthus find a solution for all but finitely many instances of the Oberwolfach problem. It is known that for O P ( 3 2 ) {\displaystyle OP(3^{2})}, O P ( 3 4 ) {\displaystyle OP(3^{4})}, O P ( 4 , 5 ) {\displaystyle OP(4,5)}, and O P ( 3 , 3 , 5 ) {\displaystyle OP(3,3,5)} no solution is possible and it is widely believed that all other instances have a solution.

The solution for large number for vertices involves many randomised steps. Cases for which a constructive solution is known include:

  • All instances O P ( x y ) {\displaystyle OP(x^{y})} except O P ( 3 2 ) {\displaystyle OP(3^{2})} and O P ( 3 4 ) {\displaystyle OP(3^{4})}.
  • All instances in which all of the cycles have even length.
  • All instances (other than the known exceptions) with n ≤ 60 {\displaystyle n\leq 60}.
  • All instances for certain choices of n {\displaystyle n}, belonging to infinite subsets of the natural numbers.
  • All instances O P ( x , y ) {\displaystyle OP(x,y)} other than the known exceptions O P ( 3 , 3 ) {\displaystyle OP(3,3)} and O P ( 4 , 5 ) {\displaystyle OP(4,5)}.

Related problems

Glock, Kühn, and Osthus suggested a generalisation of the Oberwolfach problem for k {\displaystyle k}-uniform hypergraphs (for large n {\displaystyle n}).

More precisely, for sufficiently large n {\displaystyle n} satisfying trivial necessary divisibility conditions, they conjectured that, given a collection of vertex-disjoint tight cycles F {\displaystyle F} covering n {\displaystyle n} vertices in total, the complete k {\displaystyle k}-uniform hypergraph K n ( k ) {\displaystyle K_{n}^{(k)}} can be decomposed into copies of F {\displaystyle F}. This problem is equivalent to ask for a seating chart as in the original formulation, but where every set of k {\displaystyle k} people sit consecutively exactly once throughout the dinners. Even the case where F {\displaystyle F} concists in only one cycle is still open.

Kirkman's schoolgirl problem, of grouping fifteen schoolgirls into rows of three in seven different ways so that each pair of girls appears once in each triple, is a special case of the Oberwolfach problem, O P ( 3 5 ) {\displaystyle OP(3^{5})}. The problem of Hamiltonian decomposition of a complete graph K n {\displaystyle K_{n}} is another special case, O P ( n ) {\displaystyle OP(n)}.

Alspach's conjecture, on the decomposition of a complete graph into cycles of given sizes, is related to the Oberwolfach problem, but neither is a special case of the other. If G {\displaystyle G} is a 2-regular graph with n {\displaystyle n} vertices, formed from a disjoint union of cycles of certain lengths, then a solution to the Oberwolfach problem for G {\displaystyle G} would also provide a decomposition of the complete graph into ( n − 1 ) / 2 {\displaystyle (n-1)/2} copies of each of the cycles of G {\displaystyle G}. However, not every decomposition of K n {\displaystyle K_{n}} into this many cycles of each size can be grouped into disjoint cycles that form copies of G {\displaystyle G}, and on the other hand not every instance of Alspach's conjecture involves sets of cycles that have ( n − 1 ) / 2 {\displaystyle (n-1)/2} copies of each cycle.