On m-cycle holey systems

Zhihe Liang*, Hung-Lin Fu, Wentao Wang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Let Gυ u denote the graph Kυ\Ku if both u and υ are odd, and (Kυ–F1)\(Ku–F2) if both u and υ are even, where F1 is a 1-factor of Kυ and F2 is a 1-factor of Ku with F2⊆F1. In this paper, we study the existence problem of m-cycle design of Gυ u. By using direct and recurssive constructions, we obtain several new m-cycle design of Gυ u.

Original languageEnglish
Pages (from-to)1637-1649
Number of pages13
JournalJournal of Discrete Mathematical Sciences and Cryptography
Issue number8
StatePublished - 17 Nov 2017


  • Embedding
  • Holy design
  • m-cycle design
  • Packing

Fingerprint Dive into the research topics of 'On m-cycle holey systems'. Together they form a unique fingerprint.

Cite this