TY - JOUR
T1 - Partitions into indecomposable triple systems
AU - Colbourn, Charles J.
AU - Harms, Janelle J.
PY - 1987/1
Y1 - 1987/1
N2 - The indecomposable partition problem is to partition the set of all triples on v elements into s indecomposable triple systems, where the i th triple system has index λi and λ1 + … +λs = v–2. A complete solution for v ≤ 10 is given here. Extending a construction of Rosa for large sets, we then give a v → 2v + 1 construction for indecomposable partitions. This recursive construction employs solutions to a related partition problem, called indecomposable near-partition. A partial solution to the indecomposable near-partition problem for v = 10 then establishes that for every order v = 5.2i–1, all indecomposable partitions having λi = 1,2 for each i can be realized.
AB - The indecomposable partition problem is to partition the set of all triples on v elements into s indecomposable triple systems, where the i th triple system has index λi and λ1 + … +λs = v–2. A complete solution for v ≤ 10 is given here. Extending a construction of Rosa for large sets, we then give a v → 2v + 1 construction for indecomposable partitions. This recursive construction employs solutions to a related partition problem, called indecomposable near-partition. A partial solution to the indecomposable near-partition problem for v = 10 then establishes that for every order v = 5.2i–1, all indecomposable partitions having λi = 1,2 for each i can be realized.
UR - http://www.scopus.com/inward/record.url?scp=33750694810&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33750694810&partnerID=8YFLogxK
U2 - 10.1016/S0304-0208(08)72879-2
DO - 10.1016/S0304-0208(08)72879-2
M3 - Article
AN - SCOPUS:33750694810
SN - 0304-0208
VL - 149
SP - 107
EP - 118
JO - North-Holland Mathematics Studies
JF - North-Holland Mathematics Studies
IS - C
ER -