We prove the following result: Theorem. Let \(E=\{a_ 1,\dots,a_ m\}\) be a finite set of cardinality \(m\) and let \(E_ 1,\dots,E_ n\) be \(n\) subsets of \(E\) such that \[ | E_ i\cap E_ j|= \lambda\qquad\text{for } i\neq j\qquad\text{and } | E_ i|>\lambda\qquad\text{for all } i. \] Then \(m\geq n\).
Recommendations
- A note on Fisher's inequality
- A combinatorial proof of Fisher's inequality
- A generalization of Fisher's inequality
- A sharpening of Fisher's inequality
- A simple proof of Fishburn’s moments theorem
- scientific article; zbMATH DE number 3975983
- scientific article; zbMATH DE number 3876427
- scientific article; zbMATH DE number 3929192
Cites work
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
- On the decomposition of Kn into complete m‐partite graphs
- On the decomposition ofkn into complete bipartite graphs
- ON THE TWO-COLOURING OF HYPERGRAPHS
Cited in
(9)- Linear CNF formulas and satisfiability
- On the nonuniform Fisher inequality
- A sharpening of Fisher's inequality
- A generalization of Fisher's inequality
- Subsets of a finite set that almost always intersect each other in elements
- Proof of a conjecture of Frankl and Füredi
- XSAT and NAE-SAT of linear CNF classes
- On Some SAT-Variants over Linear Formulas
- A note on Fisher's inequality
This page was built for publication: A short proof of Fisher's inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686507)
