A bandwidth theorem for approximate decompositions

DOI10.1112/plms.12218zbMath1415.05145arXiv1712.04562OpenAlexW2964248410WikidataQ128870056 ScholiaQ128870056MaRDI QIDQ4967769

Daniela Kühn, Deryk Osthus, Padraig Condon, Jae-Hoon Kim

Publication date: 10 July 2019

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

near optimal packing

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (12)

A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Graph and hypergraph packing ⋮ Tree decompositions of graphs without large bipartite holes ⋮ The bandwidth theorem for locally dense graphs ⋮ Progress towards Nash-Williams' conjecture on triangle decompositions ⋮ Optimal packings of bounded degree trees ⋮ On the relation of separability, bandwidth and embedding ⋮ Resolution of the Oberwolfach problem ⋮ Pseudorandom hypergraph matchings ⋮ Decomposing hypergraphs into cycle factors

This page was built for publication: A bandwidth theorem for approximate decompositions