The generalised Oberwolfach problem

DOI10.1016/j.jctb.2021.09.007zbMath1478.05116arXiv2004.09937OpenAlexW3207289130MaRDI QIDQ2664557

Katherine Staden, Peter Keevash

Publication date: 17 November 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.09937

zbMATH Keywords

cyclesgraph decompositions

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Density (toughness, etc.) (05C42)

Related Items (5)

Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Coloured and Directed Designs ⋮ On zero-sum spanning trees and zero-sum connectivity

Cites Work

• A complete solution to the two-table Oberwolfach problems
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• A brief review on Egmont Köhler's mathematical work
• Blow-up lemma
• The Oberwolfach problem and factors of uniform odd length cycles
• A proof of Ringel's conjecture
• Packing degenerate graphs
• On a hypergraph matching problem
• Packing spanning graphs from separable families
• Concentration Inequalities
• Coloured and Directed Designs
• A blow-up lemma for approximate decompositions
• [https://portal.mardi4nfdi.de/wiki/Publication:4870539 A linear programming perspective on the Frankl?R�dl?Pippenger theorem]
• Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
• Pseudorandom hypergraph matchings

This page was built for publication: The generalised Oberwolfach problem