An overlarge set of Kirkman triple systems, OLKTS(v), is a partition of all triples of a (v+1)-element set into v+1 Kirkman triple systems of order v, each living on the point set with one point deleted; it can exist only when . Yuan and Kang (2009) proved a conditional reduction (their Theorem C): if there exist both an overlarge set of Kirkman frames OLKF(6^k) and a 3-OLGKS(6^{k-1},4) for every , then an OLKTS(v) exists for every with . Subsequent literature shows: (i) the exceptional order has since been settled affirmatively (an explicit RDSQS(22) of Liu and Lei, 2023, yields OLKTS(21) by taking derived designs); (ii) the finite checklist itself remains entirely open — no later work constructs OLKF(6^k) or 3-OLGKS(6^{k-1},4) for any of the residual k, and the OLKTS spectrum is still incomplete as of 2026 (for instance OLKTS(51), OLKTS(69), OLKTS(75) are unknown). The problem is therefore to settle the residual checklist — construct the required Kirkman-frame overlarge sets and OLGKS modules, or prove some cannot exist — thereby completing, together with the now-settled order 21, the existence classification of OLKTS(v) for all admissible v.
Background
A Steiner triple system STS(v) is a pair where has v points and is a collection of 3-subsets (blocks) such that every 2-subset of lies in exactly one block; it exists if and only if . A Kirkman triple system KTS(v) is a resolvable STS(v): its blocks partition into parallel classes, each of which partitions the point set. Resolvability forces . A large set LKTS(v) is a partition of all triples of a v-set into disjoint KTS(v)s — a classical open existence problem since Kirkman's schoolgirl problem of 1850. An overlarge set OLKTS(v) is the variant in which one takes a set with and partitions all triples of into block sets , , such that each is a KTS(v). Necessarily . Known infinite families include the multiplicative families with prime powers obtained via the strengthened objects OLKTS of Yuan and Kang (2010) — which include OLKTS() by taking all factors equal to — together with OLKTS() of Kang and Yuan (2017); but no construction is known for all admissible v. Two auxiliary structures drive the recursive theory. A Kirkman frame KF() (Stinson, 1987) is a resolvable group divisible design with u groups of size m and block size 3: every pair of points from distinct groups lies in exactly one block, and the blocks partition into partial parallel classes (holey parallel classes), each of which misses exactly one group. An OLKF() (Yuan and Kang, 2009), an overlarge set of Kirkman frames, is a partition of all triples of a set of points, arranged in groups of size , that meet three distinct groups, into Kirkman frames: the component indexed by a point is a KF() on with the group containing deleted, and every triple meeting three distinct groups is a block of exactly one component. Note the type notation: means k groups of size 6, i.e. 6k points, so an OLKF() has components, each of type . A K-OLGKS() (Yuan and Kang, 2009), an overlarge set of generalized Kirkman systems, for a set of positive integers (for a 3-OLGKS, ), is a collection , where is a set of points partitioned into groups of size , is a disjoint -set, and , such that: (i) each , , is a Kirkman frame KF(); (ii) each , , is a modified resolvable system MRS() — a pairwise design whose block set is partitioned into parallel classes such that every block lies in exactly of them — containing the distinguished block of the group with ; (iii) every triple with for every group lies in exactly one block of ; and (iv) every block occurring in with occurs in exactly of the families . The load-bearing composition lemma is: a 3-OLGKS() together with an OLKTS(9) containing a sub-OLKTS(3) yields an OLKTS(). Yuan and Kang (2009) combined this with S(3,K,v) skeletons (3-wise balanced designs with block sizes in ; the k=5 modules are constructed in the paper itself and the k=8 modules were already available from earlier constructions, which is why Theorem C's hypothesis starts at k=6 and omits k=8, and sizes 17,21,22,25,26 are never used) to prove their Theorem C: if OLKF() and 3-OLGKS() exist for all , then OLKTS(v) exists for every , . They also proved unconditionally that OLKTS() exists for , , , , and (, ). A closely related structure is an RDSQS(n+1), a Steiner quadruple system of order n+1 whose derived design at every point is resolvable: since the derived designs of an SQS(n+1) partition all triples of the point set into STS(n)s, an RDSQS(n+1) is exactly an OLKTS(n); this requires . Follow-up work has built mainly on the RDSQS/OLKTS side: Xu and Ji (2022) produced new infinite families of LR-designs and OLKTSs; Liu and Lei (2023) constructed explicit RDSQSs including RDSQS(22); Xu and Ji (2024) introduced OLKTS(v), an overlarge-set reformulation of the RDSQS(v+1) condition that plays the same role for LKTS(3v); Tan and Zhou (2025, 2026) added further RDSQS families and proved that OLKTS() exists for every with except . None of these works touches the OLKF()/3-OLGKS() checklist, which therefore remains — seventeen years later — the only published finite reduction of the OLKTS existence problem to a finite list of explicitly bounded auxiliary designs.
Problem Statement
For every (29 values in total), establish whether there exists an overlarge set of Kirkman frames OLKF() — that is, on 6k points arranged in k groups of size 6, the partition of the triples meeting three distinct groups into 6k Kirkman frames of type — and whether there exists a 3-OLGKS(), both in the precise sense defined by Yuan and Kang (2009). By Theorem C of that paper, affirmative answers for all such k imply that an OLKTS(v) exists for every with ; since OLKTS(21) has now been constructed independently (via the RDSQS(22) of Liu and Lei, 2023), completing this checklist would settle the existence classification of overlarge sets of Kirkman triple systems for all admissible orders with no exception. A proof that an OLKF() or a 3-OLGKS() does not exist for some in this set would show that Theorem C's route cannot be completed as stated, and would require other machinery for the corresponding orders.
References
- Landang Yuan, Qingde Kang, 'Further results on overlarge sets of Kirkman triple systems', Acta Mathematica Sinica, English Series 25(3), 419-434, 2009. DOI 10.1007/s10114-008-6615-4, https://doi.org/10.1007/s10114-008-6615-4
- Landang Yuan, Qingde Kang, 'On overlarge sets of Kirkman triple systems', Discrete Mathematics 310(15-16), 2119-2125, 2010. DOI 10.1016/j.disc.2010.04.006, https://doi.org/10.1016/j.disc.2010.04.006
- Landang Yuan, Qingde Kang, 'A tripling construction for overlarge sets of KTS', Discrete Mathematics 309(4), 975-981, 2009. DOI 10.1016/j.disc.2008.01.001, https://doi.org/10.1016/j.disc.2008.01.001
- D. R. Stinson, 'Frames for Kirkman triple systems', Discrete Mathematics 65(3), 289-300, 1987. DOI 10.1016/0012-365X(87)90060-4, https://doi.org/10.1016/0012-365X(87)90060-4
- Yanxun Chang, Junling Zhou, 'Large sets of Kirkman triple systems and related designs', Journal of Combinatorial Theory, Series A 120(3), 649-670, 2013. DOI 10.1016/j.jcta.2012.12.001, https://doi.org/10.1016/j.jcta.2012.12.001
- Juanjuan Xu, Lijun Ji, 'New results on LR-designs and OLKTSs', Discrete Mathematics 345(9), article 112948, 2022. DOI 10.1016/j.disc.2022.112948, https://doi.org/10.1016/j.disc.2022.112948
- Yan Liu, Jianguo Lei, 'More results on large sets of Kirkman triple systems', Designs, Codes and Cryptography 91(8), 2677-2686, 2023. DOI 10.1007/s10623-023-01221-9, https://doi.org/10.1007/s10623-023-01221-9 (preprint arXiv:2210.06214, https://arxiv.org/abs/2210.06214; contains the explicit RDSQS(22) of Lemma 2.5)
- Juanjuan Xu, Lijun Ji, 'Special overlarge sets of Kirkman triple systems', Designs, Codes and Cryptography 92(8), 2267-2285, 2024. DOI 10.1007/s10623-024-01386-x, https://doi.org/10.1007/s10623-024-01386-x
- QingDe Kang, LanDang Yuan, 'Large sets and overlarge sets of triple systems', SCIENTIA SINICA Mathematica 47(11), 1409-1422, 2017. DOI 10.1360/N012016-00144, https://doi.org/10.1360/N012016-00144
- Yuli Tan, Junling Zhou, 'Steiner quadruple systems with minimum colorable derived designs: constructions and applications', Designs, Codes and Cryptography 93(10), 4117-4140, 2025. DOI 10.1007/s10623-025-01677-x, https://doi.org/10.1007/s10623-025-01677-x
- Yuli Tan, Junling Zhou, 'Tilings of with optimal -codes', Designs, Codes and Cryptography 94(6), article 124, 2026. DOI 10.1007/s10623-026-01853-7, https://doi.org/10.1007/s10623-026-01853-7 (preprint arXiv:2512.22754, https://arxiv.org/abs/2512.22754; Theorem 2.8 gives the current best OLKTS spectrum)
- Chen Wang, 'A new recursive construction for large sets of Kirkman triple systems', preprint arXiv:2607.21521, 2026, https://arxiv.org/abs/2607.21521