Some characterizations of type-1 \(\lambda\)-designs

DOI10.1016/0097-3165(89)90034-4zbMath0696.05007OpenAlexW2130592461MaRDI QIDQ910407

Seress, Ákos

Publication date: 1989

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(89)90034-4

zbMATH Keywords

\(\lambda\)-conjecture\(\lambda\)-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items (7)

All λ-Designs with Small λ are Type-1 ⋮ Towards the Ryser–Woodall λ $\lambda $‐design conjecture ⋮ Exceptions and characterization results for type‐1 λ‐designs ⋮ Some results on the Ryser design conjecture ⋮ Some results on λ-designs with two block sizes ⋮ Some results on the Ryser design conjecture-II ⋮ Some results on the Ryser design conjecture. III

Cites Work

• A characterization of type-1 lambda-designs
• On \(\lambda\)-designs
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• Some results on λ-designs
• The determination of all λ-designs with λ=3
• Square λ-Linked Designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some characterizations of type-1 \(\lambda\)-designs