Constructions of Disjoint Steiner Triple Systems

Cites work

scientific article; zbMATH DE number 3237887 (Why is no real title available?)
scientific article; zbMATH DE number 3311772 (Why is no real title available?)
scientific article; zbMATH DE number 3414316 (Why is no real title available?)
scientific article; zbMATH DE number 3031875 (Why is no real title available?)
Some Remarks on the Triple Systems of Steiner.

Cited in

(34)

Completing incomplete commutative Latin squares with prescribed diagonals
On large sets of disjoint Steiner triple systems. I
Two-fold triple systems without repeated blocks
A construction of disjoint Steiner triple systems
Concerning the complexity of deciding isomorphism of block designs
On the number of disjoint Mendelsohn triple systems
Disjoint finite partial Steiner triple systems can be embedded in disjoint finite Steiner triple systems
On Steiner tableaus
Some packings with Steiner triple systems
A theorem on the maximum number of disjoint Steiner triple systems
Finite embedding theorems for partial Steiner triple systems
The existence of some resolvable block designs with divisibility into groups
On making two Steiner triple systems disjoint
Intersection numbers of Kirkman triple systems
Bose's method of differences applied to construct Bhaskar Rao designs
Packing of partial designs
Spatial polyhedra without diagonals
Inverse planes with a given collection of common blocks
On the existence of 2-designs S₂(2,3,v) without repeated blocks
Double resolvability of some complete 3-designs
The family of t-designs. II
Intersections among Steiner systems
Sylvester's problem of the 15 schoolgirls
A simple construction of disjoint and almost disjoint Steiner triple systems
Covering all triples on n marks by disjoint Steiner systems
On disjoint partial triple systems
On the maximum number of disjoint Steiner triple systems
Decomposing triples of \(\mathbb Z_{p^n}\) and \(\mathbb Z_{3p^n}\) into cyclic designs
Skolem and Rosa rectangles and related designs
Derived Mendelsohn triple systems
Intersections of hypergraphs
The existence of disjoint (hooked) near‐Rosa sequences and applications
Existence and constructions of 2-designs S\(_3\)(2,3,v) without repeated blocks
On large sets of disjoint Steiner triple systems. VI

This page was built for publication: Constructions of Disjoint Steiner Triple Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5618387)