Premium
Maximal sets of triangle‐factors on v = 6m + 3 vertices
Author(s) -
Rees Rolf S.
Publication year - 1998
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(1998)6:5<309::aid-jcd1>3.0.co;2-j
Subject(s) - combinatorics , mathematics , set (abstract data type) , discrete mathematics , computer science , programming language
We show that the necessary condition m + 1 ≤ k ≤ 3 m + 1 that there exist a maximal set of k triangle‐factors on 6 m + 3 ≥ 15 vertices is also sufficient, except possibly when k = m + 1, or when 6 m + 3ϵ{45, 57, 69, 81, 93, 237, 261, 309, 333, 381}. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 309–323, 1998