Affordable Access

Publisher Website

(m,n)-cycle systems

Authors
Journal
Journal of Statistical Planning and Inference
0378-3758
Publisher
Elsevier
Publication Date
Volume
74
Issue
2
Identifiers
DOI: 10.1016/s0378-3758(98)00084-6

Abstract

Abstract We describe a method which, in certain circumstances, may be used to prove that the well-known necessary conditions for partitioning the edge set of the complete graph on an odd number of vertices (or the complete graph on an even number of vertices with a 1-factor removed) into cycles of lengths m 1, m 2,…, m t are sufficient in the case |{m 1,m 2,…,m t}| = 2 . The method is used to settle the case where the cycle lengths are 4 and 5.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Influence of surface environment on Auger peaks :...

on Solid State Communications Jan 01, 1979

Variation of electronic transition moment in some...

on Journal of Quantitative Spectr... Jan 01, 1967

The M5photoelectron line of Ag metal measured in c...

on Journal of Electron Spectrosco... Jan 01, 2005

First-principles prediction of metastable niobium...

on Solid State Sciences Jan 01, 2012
More articles like this..