| Display title | Oberwolfach problem |
| Default sort key | Oberwolfach problem |
| Page length (in bytes) | 11,169 |
| Namespace ID | 0 |
| Page ID | 188449 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Len Stevenson |
| Date of page creation | 20:15, 6 February 2024 |
| Latest editor | imported>Len Stevenson |
| Date of latest edit | 20:15, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | The Oberwolfach problem is an unsolved problem in mathematics 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... |
