Abstract
An overfull set of one-factors of K_2n is a set of one-factors that between them cover all the edges of K_2n, but contain no one-factorization of K_2n. We ask how many members such a set can contain, and obtain upper and lower bounds.
Recommended Citation
McSorley, John and Wallis, Walter D. Dr "Bounds for Overfull Sets of One-Factors." AWOCA 2004 : fifteenth Australasian Workshop on Combinatorial Algorithms (Jan 2004): 40-42.
COinS
Comments
Published in the Proceedings of AWOCA 2004 : fifteenth Australasian Workshop on Combinatorial Algorithms, Ballina Beach Resort, New South Wales, Australia, July 6-9, 2004. .