Note on bipartite graph tilings

DOI10.1137/080726434MaRDI QIDQ5392896zbMATH OpenOpenAlexFDO

Authors Jan Hladký, M. Schacht

Publication date 15 April 2011

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

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

zbMATH Keywords

extremal graph theoryTurán-type problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal combinatorics (05D99)

Abstract: Let s<t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n=k(s+t), which ensure that G has a K_{s,t}-factor. Exact result for large n is given. Our result extends the work of Zhao, who determined the minimum degree threshold which guarantees that a bipartite graph has a K_{s,s}-factor.

Recommendations

• A note on bipartite graph tiling
• Minimum degree thresholds for bipartite graph tiling
• Bipartite graph tiling
• The extremal function for partial bipartite tilings
• On 2-factors with large cycles in a bipartite graph

Cited in

(9)

• Tiling tripartite graphs with 3-colorable graphs: the extreme case
• On multipartite Hajnal-Szemerédi theorems
• 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
• Bipartite graph tiling
• The extremal function for partial bipartite tilings
• Graph Tilings in Incompatibility Systems

This page was built for publication: Note on bipartite graph tilings

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