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

Existence of 1-rotational k-cycle systems of the complete graph / Buratti, Marco. - In: GRAPHS AND COMBINATORICS. - ISSN 0911-0119. - 20:(2004), pp. 41-46.

Existence of 1-rotational k-cycle systems of the complete graph

BURATTI, Marco
2004

Abstract

We explicitly solve the existence problem for 1-rotational k-cycle systems of the complete graph $K_v$ with $v \equiv 1$ or k (mod 2k). For $v \equiv 1$ (mod 2k) we have existence if and only if k is an odd composite number. For any odd k and $v \equiv k$ (mod 2k), (except k = 3 and $v \equiv 15, 21$ (mod 24)) a 1-rotational k-cycle system of $K_v$ exists.
2004
cycle system; 1-rotational cycle system
01 Pubblicazione su rivista::01a Articolo in rivista
Existence of 1-rotational k-cycle systems of the complete graph / Buratti, Marco. - In: GRAPHS AND COMBINATORICS. - ISSN 0911-0119. - 20:(2004), pp. 41-46.
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1654627
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 17
  • ???jsp.display-item.citation.isi??? 16
social impact