Abstract
Suppose S is a set of compatible one-factors of the regular graph G which cannot be embedded in a one-factorization of G. Then S is called a premature set of factors of G. Any proper maximal set is premature, but not conversely; if fact we are most interested in what we might call properly premature sets — sets which can be extended part way, but not to a one-factorization. We discuss premature and properly premature sets in complete graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Wallis, W.D. (1997). Premature Sets of Factors. In: One-Factorizations. Mathematics and Its Applications, vol 390. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2564-3_20
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2564-3_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4766-6
Online ISBN: 978-1-4757-2564-3
eBook Packages: Springer Book Archive