On large sets of disjoint Steiner triple systems. VI
From MaRDI portal
Publication:762162
DOI10.1016/0097-3165(84)90068-2zbMATH Open0557.05012OpenAlexW4212965248MaRDI QIDQ762162FDOQ762162
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- Constructions of Disjoint Steiner Triple Systems
- On large sets of disjoint Steiner triple systems. IV
- Intersection Properties of Steiner Systems
- On the maximum number of disjoint Steiner triple systems
- A theorem on the maximum number of disjoint Steiner triple systems
- Some packings with Steiner triple systems
Cited In (46)
- Further results on large sets of disjoint group-divisible designs
- Orthogonal decomposition and packing of complete graphs
- Intersecting designs
- A new result on Sylvester's problem
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- On large sets of disjoint Steiner triple systems. V
- Overlarge sets of resolvable idempotent quasigroups
- The spectrum of maximal partial Steiner triple systems
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- Large sets of Kirkman triple systems of orders \(2^{2 n + 1} + 1\)
- On the existence of \(d\)-homogeneous \(\mu\)-way \((v, 3, 2)\) Steiner trades
- Some recent developments on BIBDs and related designs
- Towards a Large Set of Steiner Quadruple Systems
- Support sizes of completely decomposable triple systems
- Optimal partitions for triples
- Partitions of triples into optimal packings
- Title not available (Why is that?)
- Special overlarge sets of Kirkman triple systems
- Locally trivial t-designs and t-designs without repeated blocks
- Combining \(t\)-designs
- On the chromatic number, colorings, and codes of the Johnson graph
- Disjoint partial triple systems of different orders
- An alternative existence proof for \(\mathrm{LSTS}(24k+1)\)
- Optimal covering designs: complexity results and new bounds
- Construction of large sets of pairwise disjoint transitive triple systems. II
- On disjoint partial triple systems
- An improved recursive construction for disjoint Steiner quadruple systems
- Doubly resolvable Steiner quadruple systems of orders \(2^{2n+1}\)
- A new existence proof for large sets of disjoint Steiner triple systems
- Classification of partitions of all triples on ten points into copies of Fano and affine planes
- On large sets of directed triple systems
- Large sets with multiplicity
- A completion of \(LS(2^n4^1)\)
- Title not available (Why is that?)
- Existence of good large sets of Steiner triple systems
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\). (Reprint)
- Large sets of three types of oriented triple systems
- New large sets of resolvable Mendelsohn triple systems
- Title not available (Why is that?)
- Large sets of Kirkman triple systems with order \(q^n + 2\)
- Large sets of mutually almost disjoint Steiner triple systems not from Steiner quadruple systems
- Symmetric quasigroups of odd order
- Title not available (Why is that?)
- More on halving the complete designs
- On large sets of disjoint Steiner triple systems. IV
- The first infinite family of orthogonal Steiner systems \(\mathrm{S}(3,5,v)\)
This page was built for publication: On large sets of disjoint Steiner triple systems. VI
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762162)
