Sciweavers

Share
SIAMDM
2010

Note on Bipartite Graph Tilings

9 years 2 months ago
Note on Bipartite Graph Tilings
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 Ks,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 Ks,sfactor.
Jan Hladký, Mathias Schacht
Added 30 Jan 2011
Updated 30 Jan 2011
Type Journal
Year 2010
Where SIAMDM
Authors Jan Hladký, Mathias Schacht
Comments (0)
books