Graph Tiling in Bipartite Graphs

Series: 
Combinatorics Seminar
Friday, November 6, 2009 - 15:05
1.5 hours (actually 80 minutes)
Location: 
Skiles 255
,  
School of Mathematics, Georgia Tech
Organizer: 

This is joint work with Dr. Yi Zhao.

Graph tiling problems can be summarized as follows: given a graph H, what conditions do we need to find a spanning subgraph of some larger graph G that consists entirely of disjoint copies of H. The most familiar example of a graph tiling problem is finding a matching in a graph. With the Regularity Lemma and the Blow-up Lemma as our main tools, we prove a degree condition that guarantees an arbitrary bipartite graph G will be tiled by an arbitrary bipartite graph H. We also prove this degree condition is best possible up to a constant. This answers a question of Zhao and proves an asymptotic version of a result of Kuhn and Osthus for bipartite graphs.