A note on Fisher's inequality
From MaRDI portal
Publication:5961545
Recommendations
Cited in
(8)- Exceptions and characterization results for type‐1 λ‐designs
- Towards the Ryser–Woodall λ $\lambda $‐design conjecture
- A combinatorial proof of Fisher's inequality
- The combinatorics of N. G. de Bruijn
- A short proof of Fisher's inequality
- A sharpening of Fisher's inequality
- A lower bound for the number of blocks of \(t - (v,k,\lambda \)) designs with \(t\) odd
- On the nonuniform Fisher inequality
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)