Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-28T07:46:18.933Z Has data issue: false hasContentIssue false
  • English
  • Français

DECOMPOSITIONS OF COMPLETE GRAPHS

Published online by Cambridge University Press:  01 March 2000

W. R. JOHNSTONE
W. R. JOHNSTONE
Affiliation:
Department of Mathematics, University of Reading, Whiteknights, P.O. Box 220, Reading RG6 2AX
Get access

Abstract

If s1, s2, …, st are integers such that n − 1 = s1 + s2 + ··· + st and such that for each i (1 [les ] i [les ] t), 2 [les ] si [les ] n − 1 and sin is even, then Kn can be expressed as the union G1 ∪ G2 ∪ ··· ∪ Gt of t edge-disjoint factors, where for each i, Gi is si-regular and si-connected. Moreover, whenever si = sj, Gi and Gj are isomorphic.

Type
NOTES AND PAPERS
Information
Bulletin of the London Mathematical Society , Volume 32 , Issue 2 , March 2000 , pp. 141 - 145
Copyright
© The London Mathematical Society 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)