On large sets of disjoint Steiner triple systems. VI

DOI10.1016/0097-3165(84)90068-2zbMath0557.05012OpenAlexW4212965248MaRDI QIDQ762162

Jia-Xi Lu

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(84)90068-2

zbMATH Keywords

maximum number of pairwise disjoint Steiner triple systems

Mathematics Subject Classification ID

Triple systems (05B07)

Related Items

More on halving the complete designs ⋮ Construction of large sets of pairwise disjoint transitive triple systems. II ⋮ Large sets of three types of oriented triple systems ⋮ On large sets of directed triple systems ⋮ On the chromatic number, colorings, and codes of the Johnson graph ⋮ A new result on Sylvester's problem ⋮ Overlarge sets of resolvable idempotent quasigroups ⋮ The first infinite family of orthogonal Steiner systems \(\mathrm{S}(3,5,v)\) ⋮ An improved recursive construction for disjoint Steiner quadruple systems ⋮ Doubly resolvable Steiner quadruple systems of orders \(2^{2n+1}\) ⋮ Classification of partitions of all triples on ten points into copies of Fano and affine planes ⋮ New large sets of resolvable Mendelsohn triple systems ⋮ A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems ⋮ Intersecting designs ⋮ Combining \(t\)-designs ⋮ Optimal partitions for triples ⋮ Partitions of triples into optimal packings ⋮ On the existence of \(d\)-homogeneous \(\mu\)-way \((v, 3, 2)\) Steiner trades ⋮ Large sets of Kirkman triple systems with order \(q^n + 2\) ⋮ A completion of \(LS(2^n4^1)\) ⋮ Further results on large sets of disjoint group-divisible designs ⋮ Optimal covering designs: complexity results and new bounds ⋮ Support sizes of completely decomposable triple systems ⋮ Non-trivial \(t\)-designs without repeated blocks exist for all \(t\). (Reprint) ⋮ Large sets of Kirkman triple systems of orders \(2^{2 n + 1} + 1\) ⋮ Non-trivial \(t\)-designs without repeated blocks exist for all \(t\) ⋮ Symmetric quasigroups of odd order ⋮ Large sets with multiplicity ⋮ Orthogonal decomposition and packing of complete graphs ⋮ Locally trivial t-designs and t-designs without repeated blocks ⋮ A new existence proof for large sets of disjoint Steiner triple systems ⋮ On large sets of disjoint Steiner triple systems. V ⋮ Some recent developments on BIBDs and related designs

Cites Work

• On large sets of disjoint Steiner triple systems. IV
• Some packings with Steiner triple systems
• A theorem on the maximum number of disjoint Steiner triple systems
• On the maximum number of disjoint Steiner triple systems
• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
• Intersection Properties of Steiner Systems
• Constructions of Disjoint Steiner Triple Systems
• Unnamed Item