Premium
Irreducible 2‐fold cycle systems
Author(s) -
Jenkins Peter
Publication year - 2006
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20068
Subject(s) - fold (higher order function) , mathematics , combinatorics , computer science , programming language
In this paper, it is shown that for any pair of integers ( m , n ) with 4 ≤ m ≤ n , if there exists an m ‐cycle system of order n , then there exists an irreducible 2‐fold m ‐cycle system of order n , except when ( m , n ) = (5,5). A similar result has already been established for the case of 3‐cycles. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 324–332, 2006
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom