𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum packings of the complete graph with uniform length cycles

✍ Scribed by Daniel Horsley

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
86 KB
Volume
68
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we find the maximum number of pairwise edgedisjoint m-cycles which exist in a complete graph with n vertices, for all values of n and m with 3 ≀ m ≀ n.

πŸ“œ SIMILAR VOLUMES

Decomposition of the complete graph plus
Decomposition of the complete graph plus a 1-factor into cycles of equal length
✍ Mateja Ε ajna πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 354 KB πŸ‘ 1 views

## Abstract We determine the necessary and sufficient conditions for the existence of a decomposition of the complete graph of even order with a 1‐factor added into cycles of equal length. Β© 2003 Wiley Periodicals, Inc. J Combin Designs 11: 170–207, 2003; Published online in Wiley InterScience (www