The Open UniversitySkip to content

Large sets of cycle systems on nine points

Bryant, D. E.; Grannell, Mike and Griggs, Terry (2005). Large sets of cycle systems on nine points. Journal of Combinatorial Mathematics and Combinatorial Computing, 53, pp. 95–102.

Google Scholar: Look up in Google Scholar


An $m$-cycle system of order $v$, denoted by $m$CS($v$), is a decomposition of the complete graph $K_v$ into $m$-cycles. We discuss two types of large sets of $m$CS($v$) and construct examples of both types for $(m,v)=(4,9)$ and one type for $(m,v)=(6,9)$. These are the first large sets of cycle systems constructed with $m>3$, apart from the Hamiltonian cycle decompositions given by Bryant in 1998.

Item Type: Journal Article
ISSN: 0835-3026
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
Item ID: 22769
Depositing User: Mike Grannell
Date Deposited: 18 Aug 2010 13:02
Last Modified: 15 Jan 2016 14:49
Share this page:

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340