A theorem on the maximum number of disjoint Steiner triple systems

DOI10.1016/0097-3165(75)90041-2zbMath0306.05008OpenAlexW2015353395MaRDI QIDQ1217807

Alexander Rosa

Publication date: 1975

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(75)90041-2

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of block designs (05B05)

Related Items (28)

Constructions for large sets of \(L\)-intersecting Steiner triple systems ⋮ Optimal constant weight codes over \(Z_k\) and generalized designs ⋮ Indecomposable large sets of Steiner triple systems with indices 5, 6 ⋮ The existence spectrum for large sets of pure hybrid triple systems ⋮ \(\lambda \)-fold indecomposable large sets of Steiner triple systems ⋮ Construction of Steiner quadruple systems having a prescribed number of blocks in common ⋮ Pure tetrahedral quadruple systems with index two ⋮ Concerning the complexity of deciding isomorphism of block designs ⋮ On the number of disjoint Mendelsohn triple systems ⋮ On the existence of 2-designs Slambda(2,3,v) without repeated blocks ⋮ A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems ⋮ Partitioning sets of quadruples into designs. III ⋮ Optimal partitions for triples ⋮ The spectrum for large sets of pure Mendelsohn triple systems ⋮ Finite embedding theorems for partial Steiner triple systems ⋮ Symmetric quasigroups of odd order ⋮ Steiner quadruple systems - a survey ⋮ Support sizes of sixfold triple systems ⋮ On large sets of disjoint Steiner triple systems. VI ⋮ Existence of good large sets of Steiner triple systems ⋮ The family of t-designs. II ⋮ Partitions of the 4-subsets of a 13-set into disjoint projective planes ⋮ On large sets of disjoint Steiner triple systems. I ⋮ On large sets of disjoint Steiner triple systems. II ⋮ On large sets of disjoint Steiner triple systems. III ⋮ On the maximum number of disjoint triple systems ⋮ A new existence proof for large sets of disjoint Steiner triple systems ⋮ Some recent developments on BIBDs and related designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some packings with Steiner triple systems
• Parallel concepts in graph theory
• Covering all triples on n marks by disjoint Steiner systems
• Finite topologies and Hamiltonian paths
• On the maximum number of disjoint Steiner triple systems
• Construction of Large Sets of Almost Disjoint Steiner Triple Systems
• Constructions of Disjoint Steiner Triple Systems
• On one-factorizations of complete graphs

This page was built for publication: A theorem on the maximum number of disjoint Steiner triple systems