Skip to main content

Maximal sets of one-factors

Contributed Papers

  • 293 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 452)

Abstract

One-factors of the complete graph K2r on 2r vertices are considered. A set S of less than 2r-1 of these one-factors is called maximal if they are pairwise edge-disjoint, and if there is no one-factor of K2r which is edge-disjoint from all members of S.

It is shown that a maximal set in K2r must contain at least r one-factors, and that if r is even then the smallest possible maximal set has r+1 members; and both of these bounds can be realized. In fact, if n is odd and n ≤ r, then K2r contains a maximal set of 2r-n one-factors.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. (3) 2 (1952), 69–81.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. F. Harary, Graph Theory (Addison-Wesley, Reading, Mass., 1969)

    MATH  Google Scholar 

  3. J. Petersen, Die Theorie der regularen Graphen, Acta Math. 15 (1891), 193–220.

    CrossRef  MathSciNet  Google Scholar 

  4. W. T. Tutte, The factorizations of linear graphs, J. London Math. Soc. 22 (1947), 107–111.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Cousins, E., Wallis, W.D. (1975). Maximal sets of one-factors. In: Street, A.P., Wallis, W.D. (eds) Combinatorial Mathematics III. Lecture Notes in Mathematics, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0069547

Download citation

  • DOI: https://doi.org/10.1007/BFb0069547

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07154-9

  • Online ISBN: 978-3-540-37482-4

  • eBook Packages: Springer Book Archive