Skip to main content
Log in

Existence of 1-Rotational k-Cycle Systems of the Complete Graph

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

We explicitly solve the existence problem for 1-rotational k-cycle systems of the complete graph K v with v≡1 or k (mod 2k). For v≡1 (mod 2k) we have existence if and only if k is an odd composite number. For any odd k and vk (mod 2k), (except k≡3 and v≡15, 21 (mod 24)) a 1-rotational k-cycle system of K v exists.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marco Buratti.

Additional information

Final version received: June 18, 2003

Rights and permissions

Reprints and permissions

About this article

Cite this article

Buratti, M. Existence of 1-Rotational k-Cycle Systems of the Complete Graph. Graphs and Combinatorics 20, 41–46 (2004). https://doi.org/10.1007/s00373-003-0547-7

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-003-0547-7

Key words.

Navigation