Covering all triples on n marks by disjoint Steiner systems

DOI10.1016/0097-3165(73)90082-4MaRDI QIDQ2264674zbMATH OpenOpenAlexFDO

Authors Shmuel Schreiber

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

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Primes (11A41) Automorphisms, homomorphisms, endomorphisms, etc. for abelian groups (20K30) Abelian groups (20Kxx)

Cites work

• Constructions of Disjoint Steiner Triple Systems
• scientific article; zbMATH DE number 3144144 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)

Cited in

(24)

• The family of t-designs. Part I
• 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
• 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
• Some mappings of periodic groups
• Access balancing in storage systems by labeling partial Steiner systems
• A new existence proof for large sets of disjoint Steiner triple systems
• Wilson-Schreiber colourings of cubic graphs
• Coloring cubic graphs by point-intransitive Steiner triple systems
• 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
• Direct constructions of large sets of Kirkman triple systems
• Steiner triple systems without parallel classes
• An alternative existence proof for \(\mathrm{LSTS}(24k+1)\)
• On large sets of disjoint Steiner triple systems. IV
• Large sets of t-designs through partitionable sets: a survey

This page was built for publication: Covering all triples on n marks by disjoint Steiner systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264674)