On large sets of disjoint Steiner triple systems. I
From MaRDI portal
Publication:1050988
zbMath0514.05018MaRDI QIDQ1050988
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Related Items
On the large sets of \(t\)-designs of size nine, New results on LR-designs and OLKTSs, Constructions for large sets of \(L\)-intersecting Steiner triple systems, 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, Token graphs, 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, A new class for large sets of almost Hamilton cycle decompositions, More results on large sets of Kirkman triple systems, \(\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, Set-Codes with Small Intersections and Small Discrepancies, Further results on large sets of partitioned incomplete Latin squares, The existence of large set of symmetric partitioned incomplete latin squares, Anti‐Pasch optimal coverings with triples, Classification of partitions of all triples on ten points into copies of Fano and affine planes, Optimal ternary constant-composition codes with weight four and distance three, 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, Large sets of Kirkman triple systems with order \(q^n + 2\), Further results about large sets of disjoint Mendelsohn triple systems, Some new large sets of \(t\)-designs, Non-trivial \(t\)-designs without repeated blocks exist for all \(t\). (Reprint), Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\), Bounds on the sizes of constant weight covering codes, Matchings and covers in hypergraphs, Some infinite families of large sets of \(t\)-designs, On large sets of disjoint Steiner triple systems. II, A new existence proof for large sets of disjoint Steiner triple systems, On large sets of disjoint Steiner triple systems. IV, On large sets of disjoint Steiner triple systems. V
Cites Work
