Minimum degree thresholds for bipartite graph tiling

DOI10.1002/jgt.20605zbMath1242.05219arXiv1410.4585OpenAlexW3123322373MaRDI QIDQ2888882

Yi Zhao, Albert Bush

Publication date: 4 June 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

regularity lemmatilingcritical chromatic numbergraph packingblow-up lemma

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (5)

An Asymptotic Multipartite Kühn--Osthus Theorem ⋮ Asymptotic multipartite version of the Alon-Yuster theorem ⋮ On multipartite Hajnal-Szemerédi theorems ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case

Cites Work

• 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
• Tiling tripartite graphs with 3-colorable graphs
• Bipartite Graph Tiling
• [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
• Proof of a tiling conjecture of Komlós
• On Representatives of Subsets
• Problems and results on judicious partitions
• Note on Bipartite Graph Tilings
• Some Theorems on Abstract Graphs
• Proof of the Alon-Yuster conjecture

This page was built for publication: Minimum degree thresholds for bipartite graph tiling