2011/04/12 by Andrzej Czygrinow, Czygrinow, Andrzej, Louis DeBiasio +1
Engineering · Mathematics · #05C35 #05C70 #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Limits and Structures in Graph Theory #graph theory and CDMA systems #math.CO #msc:05C35 #msc:05C70
paper · pdf · doi:10.48550/arxiv.1104.2099
15 pages; To appear in SIAM Journal on Discrete Mathematics
arxiv created 2011/04/12 · openalex publication_date 2011/04/12 · arxiv updated 2015/03/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Bipartite graph tiling was studied by Zhao who gave the best possible minimum degree conditions for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies of Ks,s. Let s<t be fixed positive integers. Hladký and Schacht gave minimum degree conditions for a balanced bipartite graph on 2m(s+t) vertices to contain m vertex disjoint copies of Ks,t. Their results were best possible, except in the case when m is odd and t> 2s+1. We give the best possible minimum degree condition in this case.