A lower bound for the number of blocks of \(t - (v,k,\lambda \)) designs with \(t\) odd

DOI10.1016/J.DISC.2011.03.005zbMath1216.05006OpenAlexW1516037915WikidataQ114190768 ScholiaQ114190768MaRDI QIDQ536229

Gábor Horváth

Publication date: 16 May 2011

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.03.005

zbMATH Keywords

combinatoricsdesignFisher's inequality

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Cites Work

• On t-designs
• A note on Fisher's inequality
• Unnamed Item

This page was built for publication: A lower bound for the number of blocks of \(t - (v,k,\lambda \)) designs with \(t\) odd