Decomposing the complete graph into cycles of many lengths
type: Item
instance of: scholarly article
title: Decomposing the complete graph into cycles of many lengths
zbMATH Open document ID: 0829.05043
DOI: 10.1007/BF01929478
published in: Graphs and Combinatorics
publication date: 1996-01-10T00:00:00Z
review text: The authors show the existence of a solution to Alspach's problem when the cycle lengths are ``as distinct as possible'': for \(v\) odd, the complete graph on \(v\) vertices can be decomposed into \(v-2\) cycles of lengths \(3, 3, 4, 5, \dots, v - 1\) if \(v \geq 3\), and into \(v - 3\) cycles of lengths \(3, 4, \dots, v - 4, v - 2, v - 1,v\) if \(v \geq 7\).
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 784138
zbMATH Keywords: decomposition
zbMATH Keywords: cycle lengths
zbMATH Keywords: complete graph
author: Darryn Bryant
author: P. Adams
reviewed by: Alexander Rosa
MaRDI profile type: Publication
cites work: On Alspach's conjecture
cites work: Q4026150
full work available at URL: https://doi.org/10.1007/bf01929478
OpenAlex ID: W2055563159
description: scientific article; zbMATH DE number 784138