\(i\)-perfect \(m\)-cycle systems, \(m\leq 19\)

DOI10.1007/BF02215976zbMath0883.05110OpenAlexW1963641995MaRDI QIDQ1356809

Darryn E. Bryant, Peter J. Adams

Publication date: 23 February 1998

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137688

zbMATH Keywords

spectrum problem\(m\)-cycle system\(m\)-cycle decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Almost 2-perfect 8-cycle systems ⋮ Newi-Perfect Cycle Decompositions via Vertex Colorings of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steiner pentagon systems
• Edge-coloured designs with block size four
• The spectrum for 2-perfect 6-cycle systems
• The spectrum for lambda-fold 2-perfect 6-cycle systems
• A new class of group divisible designs with block size three
• 2-perfect \(m\)-cycle systems
• Group divisible designs with block-size four
• Optimal packings of \(K_4\)'s into a \(K_n\)
• \(2\)-perfect \(m\)-cycle systems can be equationally defined for \(m=3\), \(5\), and \(7\) only
• Partitionable perfect cycle systems with cycle lengths 6 and 8
• Combinatorial designs and related computational constructions

This page was built for publication: \(i\)-perfect \(m\)-cycle systems, \(m\leq 19\)