Skip Navigation


Bulletin of the London Mathematical Society Advance Access originally published online on September 23, 2009
Bulletin of the London Mathematical Society 2009 41(5):927-934; doi:10.1112/blms/bdp069
This Article
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
41/5/927    most recent
bdp069v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bryant, D.
Right arrow Articles by Horsley, D.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2009 London Mathematical Society

Decompositions of complete graphs into long cycles

Darryn Bryant

Department of Mathematics
The University of Queensland
Qld 4072
Australia

Daniel Horsley

Department of Mathematics
The University of Queensland
Qld 4072
Australia
danhorsley@gmail.com

Received 8 April 2008. Revision received 3 March 2009.

The problem of decomposing complete graphs into cycles of arbitrary specified lengths has attracted much attention, but remains largely unsolved. In this paper, the problem is settled in the case where the specified cycle lengths are each more than about half the order of the complete graph. The proof is based on a result that modifies certain existing cycle decompositions to produce new ones in which the lengths of two of the cycles are altered.

2000 Mathematics Subject Classification 05B30, 05C70.

This research was supported by the Australian Research Council.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.