A short proof of Fisher's inequality
From MaRDI portal
Publication:686507
DOI10.1016/0012-365X(93)90179-WzbMATH Open0788.04003OpenAlexW2092183532MaRDI QIDQ686507FDOQ686507
Authors: Renaud Palisse 
Publication date: 20 December 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90179-w
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
- scientific article; zbMATH DE number 3929192
Cites Work
- On the decomposition ofkn into complete bipartite graphs
- ON THE TWO-COLOURING OF HYPERGRAPHS
- 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
Cited In (9)
- A note on Fisher's inequality
- A sharpening of Fisher's inequality
- A generalization of Fisher's inequality
- XSAT and NAE-SAT of linear CNF classes
- Linear CNF formulas and satisfiability
- On the nonuniform Fisher inequality
- On Some SAT-Variants over Linear Formulas
- Proof of a conjecture of Frankl and Füredi
- Subsets of a finite set that almost always intersect each other in \(\lambda\) elements
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)
