---
tag: SHYRX1580S
kind: conjecture
name: Oberwolfach problem
aliases: [the-oberwolfach-problem]
sources:
  - wikipedia: en:55972236@r1349510998
    locator: Oberwolfach problem
    note: adopted
    mention: wikipedia://en/55972236
    sections: [Statement]
same_as:
  wikidata: Q48999401
  wikipedia: Oberwolfach problem
inventory: [1X74QYYQXK]
---

## Statement

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|03WKB2H474]]. 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.