An Update on the Existence of Kirkman Triple Systems with Subdesigns
Peter Dukes, Esther Lamken

TL;DR
This paper advances the understanding of Kirkman triple systems by providing new constructions, settling the extremal case, and introducing a novel method involving Kirkman frames with group divisible design subsystems.
Contribution
It introduces new constructions for KTS with subdesigns, resolves the extremal case v=2u+1, and presents a novel method using Kirkman frames with subsystems.
Findings
Complete resolution of the extremal case v=2u+1.
First infinite classes for the general problem.
Reduced the maximal case v=2u+3 to three exceptions.
Abstract
A Kirkman triple system of order , KTS, is a resolvable Steiner triple system on elements. In this paper, we investigate an open problem posed by Doug Stinson, namely the existence of KTS which contain as a subdesign a Steiner triple system of order , an STS. We present several different constructions for designs of this form. As a consequence, we completely settle the extremal case , for which a list of possible exceptions had remained for close to 30 years. Our new constructions also provide the first infinite classes for the more general problem. We reduce the other maximal case to now three possible exceptions. In addition, we obtain results for other cases of the form and also near . Our primary method introduces a new type of Kirkman frame which contains group divisible design subsystems. These subsystems can occur with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Finite Group Theory Research
