The generalised Oberwolfach problem
We prove that any quasirandom dense large graph in which all degrees are equal and even can be decomposed into any given collection of two-factors (2-regular spanning subgraphs). A special case of this result gives a new solution to the Oberwolfach problem.
Main Authors: | Keevash, P, Staden, K |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Elsevier
2021
|
Similar Items
-
Cycle frames and the Oberwolfach problem
by: Shanmuga Vadivu Andiyappan, et al.
Published: (2019-04-01) -
Cycle frames and the Oberwolfach problem
by: Shanmuga Vadivu Andiyappan, et al.
Published: (2019-04-01) -
Mathematical programming at Oberwolfach II /
by: Korte, B. H. (Bernhard H.), 1938-, et al.
Published: (1984) -
Flow in porous media : proceedings of the Oberwolfach Conference, June 21-27, 1992 /
by: Douglas, Jim, et al.
Published: (1993) -
Martingales : a report on a meeting at Oberwolfach, May 17-23, 1970 /
by: Dinges, Herman
Published: (1971)