A note on bipartite graph tiling
Abstract
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\'y 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.