2000 character limit reached
More results on large sets of Kirkman triple systems
Published 12 Oct 2022 in math.CO | (2210.06214v2)
Abstract: The existence of large sets of Kirkman triple systems (LKTSs) is one of the best-known open problems in combinatorial design theory. Steiner quadruple systems with resolvable derived designs (RDSQSs) play an important role in the recursive constructions of LKTSs. In this paper, we introduce a special combinatorial structure RDSQS*(v) and use it to present a construction for RDSQS(4v). As a consequence, some new infinite families of LKTSs are given.
Paper Prompts
Sign up for free to create and run prompts on this paper.