|
Organizers |
The decomposition threshold for bipartite graphs with minimum degree one
by
Raphael Yuster
Department of Mathematics - University of Haifa at Oranim, Israel.
Let H be a fixed bipartite graph with minimum degree one. It is shown that If G is any graph with n vertices and minimum degree at least 0.5n(1+on(1)) and e(H) divides e(G), then G can be decomposed into e(G)/e(H) edge-disjoint copies of H. The result is asymptotically sharp.
Date received: April 19, 2001
Copyright © 2001 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 Mathematical Conference Abstracts. Document # cags-43.