Covering all triples on n marks by disjoint Steiner systems
From MaRDI portal
Publication:2264674
DOI10.1016/0097-3165(73)90082-4zbMath0274.05021OpenAlexW2056130560MaRDI QIDQ2264674
Publication date: 1973
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(73)90082-4
Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Automorphisms, homomorphisms, endomorphisms, etc. for abelian groups (20K30) Abelian groups (20Kxx) Primes (11A41)
Related Items
Large sets of \(t\)-designs through partitionable sets: a survey, Extremal properties of \(t\)-SEEDs and recursive constructions, Additional constructions to solve the generalized Russian cards problem using combinatorial designs, Steiner Triple Systems with High Chromatic Index, The family of t-designs. Part I, Access balancing in storage systems by labeling partial Steiner systems, On the number of disjoint Mendelsohn triple systems, On the existence of 2-designs Slambda(2,3,v) without repeated blocks, Optimal partitions for triples, Partitions of triples into optimal packings, Direct constructions of large sets of Kirkman triple systems, Some balanced complete block designs, On Steiner tableaus, Some packings with Steiner triple systems, A theorem on the maximum number of disjoint Steiner triple systems, Steiner quadruple systems - a survey, Partitions of the 4-subsets of a 13-set into disjoint projective planes, Wilson-Schreiber Colourings of Cubic Graphs, Some mappings of periodic groups, Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems, Steiner Triple Systems without Parallel Classes, A new existence proof for large sets of disjoint Steiner triple systems, On large sets of disjoint Steiner triple systems. IV
Cites Work
