Skip to main content
Top
Published in: Designs, Codes and Cryptography 1/2017

24-03-2016

Direct constructions of large sets of Kirkman triple systems

Authors: Hao Zheng, Yanxun Chang, Junling Zhou

Published in: Designs, Codes and Cryptography | Issue 1/2017

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Research on the existence of large sets of Kirkman triple systems (LKTS) extends from the mid-eighteen hundreds to the present. In this paper we review known direct approaches of constructing LKTS and present new ideas of direct constructions. We finally prove the existence of an LKTS(v) where \(v \in \{69,141,165,213,285,309,333\}\). Combining recursive constructions yields several new infinite classes.
Appendix
Available only for authorised users
Literature
1.
go back to reference Chang Y., Ge G.: Some new large sets of KTS\((v)\). Ars Comb. 51, 306–312 (1999). Chang Y., Ge G.: Some new large sets of KTS\((v)\). Ars Comb. 51, 306–312 (1999).
2.
go back to reference Chang Y., Zhou J.: Large sets of Kirkman triple systems and related designs. J. Comb. Theory (A) 120, 649–670 (2013). Chang Y., Zhou J.: Large sets of Kirkman triple systems and related designs. J. Comb. Theory (A) 120, 649–670 (2013).
3.
go back to reference Denniston R.H.F.: Sylvester’s problem of the 15 schoolgirls. Discret. Math. 9, 229–233 (1974). Denniston R.H.F.: Sylvester’s problem of the 15 schoolgirls. Discret. Math. 9, 229–233 (1974).
4.
go back to reference Denniston R.H.F.: Further cases of double resolvability. J. Comb. Theory (A) 26, 298–303 (1979). Denniston R.H.F.: Further cases of double resolvability. J. Comb. Theory (A) 26, 298–303 (1979).
5.
go back to reference Denniston R.H.F.: Four double resolvable complete three-designs. Ars Comb. 7, 265–272 (1979). Denniston R.H.F.: Four double resolvable complete three-designs. Ars Comb. 7, 265–272 (1979).
6.
go back to reference Ge G.: More large sets of KTS\((v)\). J. Comb. Math. Comb. Comput. 49, 211–214 (2004). Ge G.: More large sets of KTS\((v)\). J. Comb. Math. Comb. Comput. 49, 211–214 (2004).
7.
go back to reference Kirkman T.P.: Note on an unanswered prize question. Camb. Dublin Math. J. 5, 255–262 (1850). Kirkman T.P.: Note on an unanswered prize question. Camb. Dublin Math. J. 5, 255–262 (1850).
8.
go back to reference Lu J.: On large sets of disjoint Steiner triple systems, I–III. J. Comb. Theory (A) 34, 140–182 (1983). Lu J.: On large sets of disjoint Steiner triple systems, I–III. J. Comb. Theory (A) 34, 140–182 (1983).
9.
go back to reference Lu J.: On large sets of disjoint Steiner triple systems, IV–V. J. Comb. Theory (A) 37, 136–192 (1984). Lu J.: On large sets of disjoint Steiner triple systems, IV–V. J. Comb. Theory (A) 37, 136–192 (1984).
10.
go back to reference Ray-Chaudhuri D.K., Wilson R.M.: Solution of Kirkman’s schoolgirl problem. Proc. Symp. Pure Math. 19, 187–204 (1971). Ray-Chaudhuri D.K., Wilson R.M.: Solution of Kirkman’s schoolgirl problem. Proc. Symp. Pure Math. 19, 187–204 (1971).
11.
go back to reference Schreiber S.: Covering all triples on \(n\) marks by disjoint Steiner systems. J. Comb. Theory (A) 15, 347–350 (1973). Schreiber S.: Covering all triples on \(n\) marks by disjoint Steiner systems. J. Comb. Theory (A) 15, 347–350 (1973).
12.
go back to reference Schreiber S., quoted by Hanani H.: Resolvable designs. In: Colloquio Internazionale Sulle Teorie Combinatorie (Atti dei Convegni Lincei), Rome, Tomo II, vol. 17, pp. 249–252 (1976). Schreiber S., quoted by Hanani H.: Resolvable designs. In: Colloquio Internazionale Sulle Teorie Combinatorie (Atti dei Convegni Lincei), Rome, Tomo II, vol. 17, pp. 249–252 (1976).
13.
go back to reference Teirlinck L.: A completion of Lu’s determination of the spectrum for large sets of disjoint Steiner triple systems. J. Comb. Theory (A) 57, 302–305 (1991). Teirlinck L.: A completion of Lu’s determination of the spectrum for large sets of disjoint Steiner triple systems. J. Comb. Theory (A) 57, 302–305 (1991).
14.
go back to reference Wilson R.M.: Some partitions of all triples into Steiner triple systems. In: Lecture Notes in Mathematics, vol. 411, pp. 267–277 (1974). Wilson R.M.: Some partitions of all triples into Steiner triple systems. In: Lecture Notes in Mathematics, vol. 411, pp. 267–277 (1974).
16.
go back to reference Zhang S., Zhu L.: Transitive resolvable idempotent symmetric quasigroups and large sets of Kirkman triple systems. Discret. Math. 247, 215–223 (2002). Zhang S., Zhu L.: Transitive resolvable idempotent symmetric quasigroups and large sets of Kirkman triple systems. Discret. Math. 247, 215–223 (2002).
17.
go back to reference Zhou J., Chang Y.: New results on large sets of Kirkman triple systems. Des. Codes Cryptogr. 55, 1–7 (2010). Zhou J., Chang Y.: New results on large sets of Kirkman triple systems. Des. Codes Cryptogr. 55, 1–7 (2010).
Metadata
Title
Direct constructions of large sets of Kirkman triple systems
Authors
Hao Zheng
Yanxun Chang
Junling Zhou
Publication date
24-03-2016
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 1/2017
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-016-0197-4

Other articles of this Issue 1/2017

Designs, Codes and Cryptography 1/2017 Go to the issue

Premium Partner