Asymptotic multipartite version of the Alon-Yuster theorem

DOI10.1016/j.jctb.2017.05.004zbMath1371.05092arXiv1307.5897OpenAlexW2963629026MaRDI QIDQ2407378

Ryan R. Martin, Jozef Skokan

Publication date: 29 September 2017

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

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

zbMATH Keywords

regularitylinear programmingtilingHajnal-Szemerédi theoremAlon-Yustermultipartite theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Linear programming (90C05) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

An Asymptotic Multipartite Kühn--Osthus Theorem ⋮ Triangle-Tilings in Graphs Without Large Independent Sets ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case ⋮ A median-type condition for graph tiling ⋮ Powers of Hamiltonian cycles in multipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate multipartite version of the Hajnal-Szemerédi theorem
• A fast algorithm for equitable coloring
• 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
• Triangle-factors in a balanced blown-up triangle
• The minimum degree threshold for perfect graph packings
• A multipartite Hajnal-Szemerédi theorem
• Tiling tripartite graphs with 3-colorable graphs
• Minimum degree thresholds for bipartite graph tiling
• A Note on Bipartite Graph Tiling
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Bipartite Graph Tiling
• [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
• On Representatives of Subsets
• A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
• Note on Bipartite Graph Tilings
• A geometric theory for hypergraph matching
• On the maximal number of independent circuits in a graph
• Proof of the Alon-Yuster conjecture

This page was built for publication: Asymptotic multipartite version of the Alon-Yuster theorem