|
Organizers |
A survey on graph tiling
by
Yi Zhao
Georgia State University
Given a graph H and a graph G, an H-tiling of G is a subgraph of G that consists of vertex-disjoint copies of H. When H is a single edge, an H-tiling is simply a matching. Graph tiling studies sufficient conditions for G to contain a perfect (or near perfect) H-tiling. In this talk we survey old results on this topic along with our recent work on multipartite tiling.
Date received: February 26, 2008
Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawn-05.