Premium
Decompositions of Complete Graphs
Author(s) -
Johnstone W. R.
Publication year - 2000
Publication title -
bulletin of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.396
H-Index - 48
eISSN - 1469-2120
pISSN - 0024-6093
DOI - 10.1112/s0024609399006724
Subject(s) - mathematics , disjoint sets , combinatorics , mathematics subject classification , disjoint union (topology) , enhanced data rates for gsm evolution , subject (documents) , discrete mathematics , telecommunications , library science , computer science
If s 1 , s 2 , …, s t are integers such that n − 1 = s 1 + s 2 + … + s t and such that for each i (1 ⩽ i ⩽ t ), 2 ⩽ s i ⩽ n − 1 and s i n is even, then K n can be expressed as the union G 1 ∪ G 2 ∪…∪ G t of t edge‐disjoint factors, where for each i , G i is s i ‐regular and s i ‐connected. Moreover, whenever s i = s j , G i and G j are isomorphic. 1991 Mathematics Subject Classification 05C70.