A completion of Lu's determination of the spectrum of large sets of disjoint Steiner Triple systems
Journal of Combinatorial Theory Series A
The fundamental construction for 3-designs
Proceedings of the first Malta conference on Graphs and combinatorics
Some new 2-resolvable Steiner quadruple systems
Designs, Codes and Cryptography
Large sets of Steiner triple systems
Surveys in combinatorics, 1995
On large sets of disjoint Kirkman triple systems
Discrete Mathematics
On Large Sets of v−1 L-Intersecting Steiner Triple Systems of Order v
Designs, Codes and Cryptography
Large sets of disjoint packings on 6k + 5 points
Journal of Combinatorial Theory Series A
A new existence proof for large sets of disjoint Steiner triple systems
Journal of Combinatorial Theory Series A
| Hi-index | 0.00 |
Recently, Franek et al. introduced large sets of v 驴 1 L-intersecting Steiner triple systems of order v (STS(v)) and gave four constructions for them (Des., Codes and Cryptogr., 26 (2002), 243---256). In this paper, we mainly focus on large sets of v 驴 1{0, 1}-intersecting STS(v) and large sets of v + 1{1}-intersecting STS(v). For this purpose, we introduce a concept of L-intersecting partitionable candelabra system (L-PCS) of order v with q(v) subsystems and establish a relationship between L-PCS and large set of q(v)L-intersecting STS(v). Some constructions for L-PCSs are also presented by 3-wise balanced designs. These facilitate the production of some new infinite classes of these large sets.