A short proof of Fisher's inequality

DOI10.1016/0012-365X(93)90179-WMaRDI QIDQ686507zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Other combinatorial set theory (03E05)

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 TWO-COLOURING OF HYPERGRAPHS
• On the decomposition of K_n into complete m‐partite graphs
• On the decomposition ofkn into complete bipartite graphs

Cited in

(9)

• On Some SAT-Variants over Linear Formulas
• XSAT and NAE-SAT of linear CNF classes
• A generalization of Fisher's inequality
• Proof of a conjecture of Frankl and Füredi
• Subsets of a finite set that almost always intersect each other in \(\lambda\) elements
• A note on Fisher's inequality
• A sharpening of Fisher's inequality
• Linear CNF formulas and satisfiability
• On the nonuniform Fisher 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)