On \(\lambda\)-designs

DOI10.1016/0097-3165(74)90072-7zbMath0283.05016OpenAlexW2071899328MaRDI QIDQ1844239

Earl S. Kramer

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)90072-7

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Related Items (10)

All λ-Designs with Small λ are Type-1 ⋮ Multiplicative designs I: The normal and reducible cases ⋮ A theorem in combinatorial matrix theory ⋮ Towards the Ryser–Woodall λ $\lambda $‐design conjecture ⋮ Multiplicative designs II. Uniform normal and related structures ⋮ Exceptions and characterization results for type‐1 λ‐designs ⋮ Matrices and set intersections ⋮ Some characterizations of type-1 \(\lambda\)-designs ⋮ Some results on λ-designs with two block sizes ⋮ Some results on the Ryser design conjecture-II

Cites Work

• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• On t-Designs and Groups
• Some results on λ-designs
• The determination of all λ-designs with λ=3
• Square λ-Linked Designs
• On some Theorems in Combinatorics Relating to Incomplete Block Designs
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(\lambda\)-designs