On the existence of 2-designs Slambda(2,3,v) without repeated blocks

DOI10.1016/0012-365X(83)90153-XzbMath0502.05008MaRDI QIDQ1172639

Michel Dehon

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

2-designs with k=3

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items (23)

Spatial polyhedra without diagonals ⋮ Indecomposable triple systems exist for all lambda ⋮ Constructing regular self-complementary uniform hypergraphs ⋮ More on halving the complete designs ⋮ Super-simple pairwise balanced designs with block sizes 3 and 4 ⋮ All block designs with \(b={v\choose k}/2\) exist ⋮ \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\) ⋮ Construction for indecomposable simple \((v, k, \lambda)\)-BIBDs ⋮ On completely regular codes with minimum eigenvalue in geometric graphs ⋮ On the inclusion matrix \(W_{23}(v)\) ⋮ Design theory and some forbidden configurations ⋮ Packing cliques in 3‐uniform hypergraphs ⋮ Automorphism groups of certain simple \(2\)-\((q,3,\lambda)\) designs constructed from finite fields ⋮ The size of 3-uniform hypergraphs with given matching number and codegree ⋮ A recursive construction for simple \(t\)-designs using resolutions ⋮ Twofold triple systems without 2-intersecting Gray codes ⋮ Support sizes of triple systems ⋮ Forbidden configurations and Steiner designs ⋮ On Perfect 2‐Colorings of Johnson Graphs J(v, 3) ⋮ Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4 ⋮ Further results on existentially closed graphs arising from block designs ⋮ Existence of simple BIBDs from a prime power difference family with minimum index ⋮ Superpure digraph designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence and constructions of 2-designs S\(_3\)(2,3,v) without repeated blocks
• Some balanced complete block designs
• Some packings with Steiner triple systems
• A theorem on the maximum number of disjoint Steiner triple systems
• On the existence of 2-designs S\(_2\)(2,3,v) without repeated blocks
• Covering all triples on n marks by disjoint Steiner systems
• A simplification of Moore's proof of the existence of Steiner triple systems
• On the maximum number of disjoint Steiner triple systems
• The Existence and Construction of Balanced Incomplete Block Designs

This page was built for publication: On the existence of 2-designs Slambda(2,3,v) without repeated blocks