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

DOI10.1016/J.DISC.2011.03.005zbMATH Open1216.05006OpenAlexW1516037915WikidataQ114190768 ScholiaQ114190768MaRDI QIDQ536229FDOQ536229

Authors: 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

Recommendations

• \(t\)-designs with the number of blocks close to the Fisher type lower bound
• Generalising Fisher's inequality to coverings and packings
• On the number of blocks in a generalized Steiner system
• scientific article; zbMATH DE number 2159645
• Publication:3481711

zbMATH Keywords

combinatoricsdesignFisher's inequality

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Cites Work

• On t-designs
• Title not available (Why is that?)
• A note on Fisher's inequality

Cited In (2)

• \(t\)-designs with the number of blocks close to the Fisher type lower bound
• New lower bounds for \(t\)-coverings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536229)