A short proof of Fisher's inequality
From MaRDI portal
Publication:686507
DOI10.1016/0012-365X(93)90179-WzbMath0788.04003MaRDI QIDQ686507
Publication date: 20 December 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
03E05: Other combinatorial set theory
Related Items
Linear CNF formulas and satisfiability, A generalization of Fisher's inequality, Subsets of a finite set that almost always intersect each other in \(\lambda\) elements, Proof of a conjecture of Frankl and Füredi, On Some SAT-Variants over Linear Formulas
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 ofkn into complete bipartite graphs
- On the decomposition of Kn into complete m‐partite graphs
- ON THE TWO-COLOURING OF HYPERGRAPHS