A Note on Bipartite Graph Tiling

Bipartite graph tiling was studied by Zhao [SIAM J. Discrete Math., 23 (2009), pp. 888-900], who gave the best possible minimum degree conditions for a balanced bipartite graph on $2ms$ vertices to contain $m$ vertex disjoint copies of $K_{s,s}$. Let $s 2s+1$. We give the best possible minimum degre...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on discrete mathematics 2011-01, Vol.25 (4), p.1477-1489
Main Authors: Czygrinow, Andrzej, DeBiasio, Louis
Format: Article
Language:English
Subjects:
Graphs
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Bipartite graph tiling was studied by Zhao [SIAM J. Discrete Math., 23 (2009), pp. 888-900], who gave the best possible minimum degree conditions for a balanced bipartite graph on $2ms$ vertices to contain $m$ vertex disjoint copies of $K_{s,s}$. Let $s 2s+1$. We give the best possible minimum degree condition in this case.
ISSN:0895-4801
1095-7146
DOI:10.1137/100788203