Construction of large sets of pairwise disjoint transitive triple systems II

C.C Lindner
1987 Discrete Mathematics  
The maximum number of pairwise disjoint transitive triple systems (T'I'Ss) of order n is 3(n -2). Such a collection is called a large set of pairwise disjoint TI'Ss of order n. The main result in this paper is the proof of the following theorem: If n -1 or 5 (rood 6), and there exists a large set of pairwise disjoint TI'Ss of order 2 + v, then there -exists a large set of pairwise disjoint TI'Ss of order 2 + vn. Two consequences of this result are the existence of a large set of pairwise
more » ... t TI'Ss of every odd admissible order and the existence of a large set of pairwise disjoint TI'Ss of every admissible order ~1000, except possibly 130 and 258.
doi:10.1016/0012-365x(87)90211-1 fatcat:nxpi4w2xlvfnxhcrqlhzyo56je