On large sets of disjoint Steiner triple systems. IV
From MaRDI portal
(Redirected from Publication:797587)
Recommendations
Cites work
- Covering all triples on n marks by disjoint Steiner systems
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- On large sets of disjoint Steiner triple systems. I
- On large sets of disjoint Steiner triple systems. III
- On Quadruple Systems
- Parallel concepts in graph theory
- Some packings with Steiner triple systems
Cited in
(56)- Existence of good large sets of Steiner triple systems
- The construction of large sets of idempotent quasigroups
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- Hamilton surfaces for the complete even symmetric bipartite graph
- Some infinite families of large sets of \(t\)-designs
- On large sets of Kirkman triple systems and 3-wise balanced design.
- A new class for large sets of almost Hamilton cycle decompositions
- Optimal ternary constant-composition codes with weight four and distance three
- New lower bounds on 2-spontaneous emission error designs
- On the existence of \(d\)-homogeneous \(\mu\)-way \((v, 3, 2)\) Steiner trades
- Further results on 3-spontaneous emission error designs
- Bounds on the sizes of constant weight covering codes
- Support sizes of completely decomposable TS\((v, 4)\)
- Partitions of sets of two-fold triple systems, and their relations to some strongly regular graphs
- Indecomposable large sets of Steiner triple systems with indices 5, 6
- Large sets of Hamilton cycle and path decompositions of complete bipartite graphs
- New results on LR-designs and OLKTSs
- 2-\((v,5;m)\) spontaneous emission error designs
- New results on large sets of Kirkman triple systems
- Constructions for large sets of \(L\)-intersecting Steiner triple systems
- Bounds and constructions of \(t\)-spontaneous emission error designs
- Existence of frame-derived H-designs
- Multicolor Ramsey numbers for triple systems
- Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\)
- Well-balanced designs for data placement
- Bounds on the dimensions of 2-spontaneous emission error designs
- scientific article; zbMATH DE number 3882436 (Why is no real title available?)
- Disjoint partial triple systems of different orders
- Efficient two-stage group testing algorithms for genetic screening
- scientific article; zbMATH DE number 4069692 (Why is no real title available?)
- Constructions for large sets of \(v-1\{0,{v\over 3}\}\)-intersecting Steiner triple systems of order \(v\)
- Extremal properties of \(t\)-SEEDs and recursive constructions
- scientific article; zbMATH DE number 782049 (Why is no real title available?)
- Completely reducible super-simple designs with block size five and index two
- Covering 2-paths uniformly
- Construction of Uniform Designs and Complex-Structured Uniform Designs via Partitionable t-Designss
- Direct constructions of large sets of Kirkman triple systems
- Asymptotic bounds for general covering designs
- Mutually orthogonal cycle systems
- More results on large sets of Kirkman triple systems
- Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
- Further results on large sets of partitioned incomplete Latin squares
- Orthogonal cycle systems with cycle length less than 10
- The existence of large set of symmetric partitioned incomplete latin squares
- \(\lambda \)-fold indecomposable large sets of Steiner triple systems
- Mutually disjoint Steiner systems from BCH codes
- Partition of ordered triples into uniform holey ordered designs
- Existence of \(\mathrm{LS}^+ (2^n 4^1)\)s
- Heffter spaces
- Existence spectrum of LD designs
- Large sets of disjoint packings on \(6k+5\) points
- Tilings of \(\mathcal{H}_q(n,w)\) with optimal \((n,d,w)_q\)-codes
- On large sets of disjoint Steiner triple systems. VI
- On large sets of disjoint Steiner triple systems. V
- Large sets of t-designs through partitionable sets: a survey
- Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs
This page was built for publication: On large sets of disjoint Steiner triple systems. IV
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797587)
