Resolution of the Oberwolfach problem
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Glock, Stefan | ko |
| dc.contributor.author | Joos, Felix | ko |
| dc.contributor.author | Kim, Jaehoon | ko |
| dc.contributor.author | Kuhn, Daniela | ko |
| dc.contributor.author | Osthus, Deryk | ko |
| dc.date.accessioned | 2021-06-30T01:30:15Z | - |
| dc.date.available | 2021-06-30T01:30:15Z | - |
| dc.date.created | 2021-06-30 | - |
| dc.date.created | 2021-06-30 | - |
| dc.date.created | 2021-06-30 | - |
| dc.date.created | 2021-06-30 | - |
| dc.date.issued | 2021-08 | - |
| dc.identifier.citation | JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, v.23, no.8, pp.2511 - 2547 | - |
| dc.identifier.issn | 1435-9855 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/286291 | - |
| dc.description.abstract | The Oberwolfach problem, posed by Ringel in 1967. asks for a decomposition of K-2n(+1) into edge-disjoint copies of a given 2-factor. We show that this can be achieved for all large n. We actually prove a significantly more general result, which allows for decompositions into more general types of factors. In particular. this also resolves the Hamilton-Waterloo problem for large n. | - |
| dc.language | English | - |
| dc.publisher | EUROPEAN MATHEMATICAL SOC-EMS | - |
| dc.title | Resolution of the Oberwolfach problem | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000658593500001 | - |
| dc.identifier.scopusid | 2-s2.0-85108441234 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 23 | - |
| dc.citation.issue | 8 | - |
| dc.citation.beginningpage | 2511 | - |
| dc.citation.endingpage | 2547 | - |
| dc.citation.publicationname | JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY | - |
| dc.identifier.doi | 10.4171/JEMS/1060 | - |
| dc.contributor.localauthor | Kim, Jaehoon | - |
| dc.contributor.nonIdAuthor | Glock, Stefan | - |
| dc.contributor.nonIdAuthor | Joos, Felix | - |
| dc.contributor.nonIdAuthor | Kuhn, Daniela | - |
| dc.contributor.nonIdAuthor | Osthus, Deryk | - |
| dc.description.isOpenAccess | N | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | Decompositions | - |
| dc.subject.keywordAuthor | resolvable designs | - |
| dc.subject.keywordAuthor | 2-factors | - |
| dc.subject.keywordAuthor | cycles | - |
| dc.subject.keywordPlus | DECOMPOSITIONS | - |
| dc.subject.keywordPlus | GRAPHS | - |
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 12 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.