On large sets of disjoint Steiner triple systems. IV
From MaRDI portal
Publication:797587
DOI10.1016/0097-3165(84)90066-9zbMath0545.05014OpenAlexW4206826839MaRDI QIDQ797587
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)90066-9
Related Items
Construction of Uniform Designs and Complex-Structured Uniform Designs via Partitionable t-Designss ⋮ New results on LR-designs and OLKTSs ⋮ New results on large sets of Kirkman triple systems ⋮ Constructions for large sets of \(L\)-intersecting Steiner triple systems ⋮ The construction of large sets of idempotent quasigroups ⋮ Large sets of \(t\)-designs through partitionable sets: a survey ⋮ Partitions of sets of two-fold triple systems, and their relations to some strongly regular graphs ⋮ Bounds and constructions of \(t\)-spontaneous emission error designs ⋮ Efficient two-stage group testing algorithms for genetic screening ⋮ Covering 2-paths uniformly ⋮ 2-\((v,5;m)\) spontaneous emission error designs ⋮ Indecomposable large sets of Steiner triple systems with indices 5, 6 ⋮ Constructions for large sets of \(v-1\{0,{v\over 3}\}\)-intersecting Steiner triple systems of order \(v\) ⋮ Existence of frame-derived H-designs ⋮ Extremal properties of \(t\)-SEEDs and recursive constructions ⋮ A new class for large sets of almost Hamilton cycle decompositions ⋮ More results on large sets of Kirkman triple systems ⋮ Large sets of Hamilton cycle and path decompositions of complete bipartite graphs ⋮ Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs ⋮ \(\lambda \)-fold indecomposable large sets of Steiner triple systems ⋮ Probabilistic existence of large sets of designs ⋮ 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 ⋮ Multicolor Ramsey numbers for triple systems ⋮ On large sets of Kirkman triple systems and 3-wise balanced design. ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ New lower bounds on 2-spontaneous emission error designs ⋮ Completely reducible super-simple designs with block size five and index two ⋮ On the existence of \(d\)-homogeneous \(\mu\)-way \((v, 3, 2)\) Steiner trades ⋮ Direct constructions of large sets of Kirkman triple systems ⋮ Asymptotic Bounds for General Covering Designs ⋮ Large sets of disjoint packings on \(6k+5\) points ⋮ Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\) ⋮ Further results on 3-spontaneous emission error designs ⋮ Well-Balanced Designs for Data Placement ⋮ Bounds on the sizes of constant weight covering codes ⋮ Hamilton surfaces for the complete even symmetric bipartite graph ⋮ On large sets of disjoint Steiner triple systems. VI ⋮ Bounds on the Dimensions of 2-Spontaneous Emission Error Designs ⋮ Existence of good large sets of Steiner triple systems ⋮ Some infinite families of large sets of \(t\)-designs ⋮ On large sets of disjoint Steiner triple systems. V ⋮ Support sizes of completely decomposable TS\((v, 4)\) ⋮ Mutually orthogonal cycle systems
Cites Work
- Unnamed Item
- On large sets of disjoint Steiner triple systems. I
- On large sets of disjoint Steiner triple systems. III
- Some packings with Steiner triple systems
- Parallel concepts in graph theory
- Covering all triples on n marks by disjoint Steiner systems
- On Quadruple Systems
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
This page was built for publication: On large sets of disjoint Steiner triple systems. IV
