Oberwolfach problem
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. 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.
Further reading
- Wikipedia, page 55972236, revision 1349510998, Oberwolfach problem. adopted
About this page
| Tag | SHYRX1580S |
|---|---|
| URI | m2://SHYRX1580S |
| Aliases | the-oberwolfach-problem |
| Kind | conjecture |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status SHYRX1580S. |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- edge uses out (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.