|
Organizers |
K4-e Design on Complete Graphs with Holes
by
Roxanne Baker
Auburn University
Coauthors: Dean Hoffman, Auburn University
A complete graph of order n with a hole of size v, Kn/Kv, is a complete graph of order n from which the edges of a complete graph of order v have been removed. Let H be a complete graph with a hole of size v where v(H)= d + v. We investigate when H can be decomposed into edge disjoint isomorphic copies of K4-e. We have nearly completed a proof showing the necessary conditions are also sufficient when d is even. Some work has been done on the case when d is odd.
Date received: October 31, 2005
Copyright © 2005 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 # carr-45.