Skip to main content

Perfect Factorizations

  • Chapter
One-Factorizations

Part of the book series: Mathematics and Its Applications ((MAIA,volume 390))

Abstract

Recall that a one-factorization is called perfect if it contains no two-division; in other words, the union of any two factors is a Hamilton cycle. Perfect one-factorizations exist for many orders, and we know of no order n (greater than 1) for which no perfect one-factorization of K 2n , exists, but the existence question is not yet settled.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Wallis, W.D. (1997). Perfect Factorizations. In: One-Factorizations. Mathematics and Its Applications, vol 390. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2564-3_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2564-3_16

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4766-6

  • Online ISBN: 978-1-4757-2564-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics