Resolution of the Oberwolfach problem

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 51
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorGlock, Stefanko
dc.contributor.authorJoos, Felixko
dc.contributor.authorKim, Jaehoonko
dc.contributor.authorKuhn, Danielako
dc.contributor.authorOsthus, Derykko
dc.date.accessioned2021-06-30T01:30:15Z-
dc.date.available2021-06-30T01:30:15Z-
dc.date.created2021-06-30-
dc.date.created2021-06-30-
dc.date.issued2021-
dc.identifier.citationJOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, v.23, no.8, pp.2511 - 2547-
dc.identifier.issn1435-9855-
dc.identifier.urihttp://hdl.handle.net/10203/286291-
dc.description.abstractThe 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.languageEnglish-
dc.publisherEUROPEAN MATHEMATICAL SOC-EMS-
dc.titleResolution of the Oberwolfach problem-
dc.typeArticle-
dc.identifier.wosid000658593500001-
dc.type.rimsART-
dc.citation.volume23-
dc.citation.issue8-
dc.citation.beginningpage2511-
dc.citation.endingpage2547-
dc.citation.publicationnameJOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY-
dc.identifier.doi10.4171/JEMS/1060-
dc.contributor.localauthorKim, Jaehoon-
dc.contributor.nonIdAuthorGlock, Stefan-
dc.contributor.nonIdAuthorJoos, Felix-
dc.contributor.nonIdAuthorKuhn, Daniela-
dc.contributor.nonIdAuthorOsthus, Deryk-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorDecompositions-
dc.subject.keywordAuthorresolvable designs-
dc.subject.keywordAuthor2-factors-
dc.subject.keywordAuthorcycles-
dc.subject.keywordPlusDECOMPOSITIONS-
dc.subject.keywordPlusGRAPHS-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0