An Asymptotic Multipartite Kühn--Osthus Theorem

DOI10.1137/16M1070621zbMath1366.05057arXiv1604.03002MaRDI QIDQ5275440

Ryan R. Martin, Jozef Skokan, Richard Mycroft

Publication date: 14 July 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

regularitylinear programmingtilingmultipartiteHajnal-Szemerédi theoremKühn-Osthus theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Triangle‐factors in pseudorandom graphs ⋮ Powers of Hamiltonian cycles in multipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing \(k\)-partite \(k\)-uniform hypergraphs
• Quadripartite version of the Hajnal-Szemerédi theorem
• Blow-up lemma
• Tiling Turán theorems
• Tripartite version of the Corrádi-Hajnal theorem
• \(H\)-factors in dense graphs
• The minimum degree threshold for perfect graph packings
• A multipartite Hajnal-Szemerédi theorem
• Asymptotic multipartite version of the Alon-Yuster theorem
• Minimum degree thresholds for bipartite graph tiling
• On the Complexity of General Graph Factor Problems
• Embedding large subgraphs into dense graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
• Proof of a tiling conjecture of Komlós
• Regularity Lemma for k-uniform hypergraphs
• A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
• Paths, Trees, and Flowers
• On the maximal number of independent circuits in a graph
• The Factorization of Linear Graphs
• Proof of the Alon-Yuster conjecture

This page was built for publication: An Asymptotic Multipartite Kühn--Osthus Theorem