Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cao H, Ji L and Zhu L (2004). Large sets of disjoint packings on 6k + 5 points. J Combin Theory (A) 108: 169–183
Cayley A (1850) On the triadic arrangements of seven and fifteen things, London Edinburgh and Dublin Philos Mag and J Sci 3:37:50–53 (Collected Mathematical papers I, pp 481–484)
Franek F, Grannell MJ, Griggs TS and Rosa A (2002). On the large sets of v − 1 L-intersecting Steiner triple systems of order v. Des Codes Cryptogr 26: 243–256
Griggs TS, Rosa A (1995) Large sets of Steiner triple systems. In: Rowlinson P (ed) Surveys in combinatorics. London Math Soc Lecture Note Series, vol 218. Cambridge University Press, pp 25–39
Hanani H (1960). On quadruple systems. Can J Math 12: 145–157
Hanani H (1979). A class of three-designs. J Combin Theory (A) 26: 1–19
Hartman A (1994). The fundamental constructions for 3-designs. Discrete Math 124: 107–132
Hartman A and Phelps KT (1992). Steiner quadruple systems. In: Dinitz, JH and Stinson, DR (eds) Contemporary design theory, pp 205–240. Wiley, New York
Ji L (2005). A new existence proof for large sets of disjoint Steiner triple systems. J Combin Theory (A) 112: 308–327
Ji L, Lei J. Further results on large sets of Kirkman triple systems. preprint
Kirkman TP (1847). On a problem in combinations. Cambridge Dublin Math J 2: 191–204
Lei J (2002). On large sets of Kirkman triple systems. Discrete Math 257: 63–81
Lindner CC and Rosa A (1975). Construction of large sets of almost disjoint Steiner triple systems. Can J Math 27: 256–260
Lu JX (1983) On large sets of disjoint Steiner triple systems I, II, and III. J Combin Theory (A) 34:140–146, 147–155, and 156–182
Lu JX (1984) On large sets of disjoint Steiner triple systems IV, V, and VI. J Combin Theory (A) 37:136–163, 164–188, and 189–192
Mills WH (1990). On the existence of H designs. Congr Numer 79: 129–141
Mohácsy H and Ray-Chaudhuri DK (2002). Candelabra systems and designs. J Stat Plann Inference 106: 419–448
Rosa A (1975). A theorem on the maximum number of disjoint Steiner triple systems. J Combin Theory A 18: 305–312
Teirlinck L (1991). A completion of Lu’s determination of the spectrum of large sets of disjoint Steiner triple systems. J Combin Theory (A) 57: 302–305
Teirlinck L (1994). Some new 2-resolvable Steiner quadruple systems. Des Codes Cryptogr 4: 5–10
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Communicated by: L. Teirlinck.
Research supported by Tianyuan Mathematics Foundation of NSFC Grant 10526032 and Natural Science Foundation of Universities of Jiangsu Province Grant 05KJB110111.
Rights and permissions
About this article
Cite this article
Ji, L. Constructions for large sets of L-intersecting Steiner triple systems. Des. Codes Cryptogr. 45, 39–49 (2007). https://doi.org/10.1007/s10623-007-9080-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-007-9080-7