Atlas home || Conferences | Abstracts | about Atlas

21st Cumberland Conference on Graph Theory, Combinatorics, and Computing ---In Honor of Mike Plummer's 70th Birthday
May 15-17, 2008
Vanderbilt University
Nashville, TN, USA

Organizers
Mark Ellingham and Gexin Yu

View Abstracts
Conference Homepage

Overfull sets of one-factors
by
W D Wallis
Southern Illinois University, Carbondale

A set of t one-factors of K2n is called an overfull factorization if the factors cover all edges of K2n but no 2n-1 of them form a one-factorization. In particular, if t = 2n the set is called an excessive factorization. We address the question: what is the maximum size of an overfull set?

Date received: April 18, 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-45.