Intersections among Steiner systems

DOI10.1016/0097-3165(74)90054-5zbMath0282.05011OpenAlexW2072470077MaRDI QIDQ1843437

Earl S. Kramer, Dale M. Mesner

Publication date: 1974

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(74)90054-5

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30)

Related Items (40)

Inverse planes with a given collection of common blocks ⋮ An extending theorem for \(s\)-resolvable \(t\)-designs ⋮ Bounds and constructions of \(t\)-spontaneous emission error designs ⋮ Intersections Among Ordered Quadruple Systems ⋮ The flower intersection problem for \(S(2,4,v)\)'s ⋮ Indecomposable triple systems ⋮ The fine triangle intersection problem for \((K_4 - e)\)-designs ⋮ Construction of Steiner quadruple systems having a prescribed number of blocks in common ⋮ Set-Codes with Small Intersections and Small Discrepancies ⋮ An improved recursive construction for disjoint Steiner quadruple systems ⋮ The fine triangle intersections for maximum kite packings ⋮ On the set \(J(v)\) for Steiner quadruple systems of order \(v=2^ n\) with \(n\geq 4\) ⋮ The fine triangle intersection problem for kite systems ⋮ Intersecting designs ⋮ Unnamed Item ⋮ Partitioning sets of quadruples into designs. III ⋮ A survey of Kirkman triple systems and related designs ⋮ Intersections and supports of quadruple systems ⋮ Maximum sets of mutually disjoint 2-chromatic Steiner quadruple systems ⋮ Intersections of Steiner quadruple systems ⋮ The 3-way intersection problem for kite systems ⋮ On Steiner tableaus ⋮ The extended 1-perfect trades in small hypercubes ⋮ Unnamed Item ⋮ The triangle intersection numbers of a pair of disjoint \(S(2,4,v)\)s ⋮ The triangle intersection problem for \(S(2,4,v)\) designs ⋮ The intersection problem for 2-\((v,5,1)\) directed block designs ⋮ Non-trivial \(t\)-designs without repeated blocks exist for all \(t\). (Reprint) ⋮ Non-trivial \(t\)-designs without repeated blocks exist for all \(t\) ⋮ Steiner quadruple systems - a survey ⋮ Orthogonal decomposition and packing of complete graphs ⋮ Unnamed Item ⋮ Locally trivial t-designs and t-designs without repeated blocks ⋮ Pairwise Disjoint intersections Among Steiner Quadruple Systems ⋮ The family of t-designs. II ⋮ Partitions of the 4-subsets of a 13-set into disjoint projective planes ⋮ Some \(t\)-designs are minimal \((t+1)\)-coverings ⋮ Some mutually disjoint Steiner systems ⋮ Intersections of Steiner systems S(3,4,v) with \(v=5\cdot 2^ n\) ⋮ Intersection of the Steiner systems of \(M_{24}\)

Cites Work

• Unnamed Item
• An infinite class of 5-designs
• On t-Designs and Groups
• Disjoint Steiner systems associated with the Mathieu groups
• New 5-designs
• A Group of Order 8,315,553,613,086,720,000
• A Theorem on Steiner Systems
• Constructions of Disjoint Steiner Triple Systems

This page was built for publication: Intersections among Steiner systems