{
  "aliases": [
    "the-oberwolfach-problem"
  ],
  "backlinks": null,
  "body": "\n## Statement\n\nIn 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.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "the-oberwolfach-problem"
    ],
    "inventory": [
      "1X74QYYQXK"
    ],
    "kind": "conjecture",
    "name": "Oberwolfach problem",
    "same_as": {
      "wikidata": "Q48999401",
      "wikipedia": "Oberwolfach problem"
    },
    "sources": [
      {
        "locator": "Oberwolfach problem",
        "mention": "wikipedia://en/55972236",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:55972236@r1349510998"
      }
    ],
    "tag": "SHYRX1580S"
  },
  "kind": "conjecture",
  "link": "https://math2.tamnd.com/node/SHYRX1580S/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/SHYRX1580S.md",
  "msc": null,
  "name": "Oberwolfach problem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/SHY/SHYRX1580S.md",
  "status": null,
  "tag": "SHYRX1580S",
  "uri": "m2://SHYRX1580S",
  "url": "https://math2.tamnd.com/wiki/oberwolfach-problem/",
  "writing": {
    "tag": "SHYRX1580S",
    "kind": "conjecture",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "have": 0,
        "want": 1
      }
    ]
  }
}