Bipartite Graph Tiling

DOI10.1137/060665397zbMath1191.05075OpenAlexW2072775530MaRDI QIDQ3563949

Yi Zhao

Publication date: 1 June 2010

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

Full work available at URL: https://semanticscholar.org/paper/29d1948d5b257c12e908b6e5682951e49e6441a8

zbMATH Keywords

tilinggraph packingblow-up Lemmaregularity Lemma

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 (9)

Minimum degree thresholds for bipartite graph tiling ⋮ 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 ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case ⋮ On the Chromatic Number of Matching Kneser Graphs ⋮ Vertex-disjoint double chorded cycles in bipartite graphs ⋮ Results and problems on chorded cycles: a survey

This page was built for publication: Bipartite Graph Tiling