A note on Fisher's inequality
From MaRDI portal
Publication:5961545
DOI10.1006/JCTA.1996.2729zbMATH Open0878.05011OpenAlexW2014929150MaRDI QIDQ5961545FDOQ5961545
Publication date: 25 February 1997
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1996.2729
Cited In (7)
- A short proof of Fisher's inequality
- A lower bound for the number of blocks of \(t - (v,k,\lambda \)) designs with \(t\) odd
- A sharpening of Fisher's inequality
- Exceptions and characterization results for type‐1 λ‐designs
- The combinatorics of N. G. de Bruijn
- A combinatorial proof of Fisher's inequality
- Towards the Ryser–Woodall λ $\lambda $‐design conjecture
This page was built for publication: A note on Fisher's inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961545)