Bipartite graph tiling

DOI10.1137/060665397MaRDI QIDQ3563949zbMATH OpenOpenAlexFDO

Authors 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

blow-up Lemmagraph packingregularity Lemmatiling

Mathematics Subject Classification ID

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

Recommendations

• A note on bipartite graph tiling
• Minimum degree thresholds for bipartite graph tiling
• Note on bipartite graph tilings
• On vertex-disjoint complete bipartite subgraphs in a bipartite graph
• Vertex-disjoint quadrilaterals in bipartite graphs

Cited in

(13)

• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Tiling tripartite graphs with 3-colorable graphs: the extreme case
• On multipartite Hajnal-Szemerédi theorems
• Results and problems on chorded cycles: a survey
• Vertex-disjoint double chorded cycles in bipartite graphs
• Asymptotic multipartite version of the Alon-Yuster theorem
• Minimum degree thresholds for bipartite graph tiling
• A note on bipartite graph tiling
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Generating near‐bipartite bricks
• On the chromatic number of matching Kneser graphs
• Note on bipartite graph tilings
• Graph Tilings in Incompatibility Systems

This page was built for publication: Bipartite graph tiling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563949)