A generalization of Fisher's inequality

DOI10.1006/jcta.1998.2901zbMath0917.05076OpenAlexW1982047586MaRDI QIDQ1279662

Hunter S. Snevily

Publication date: 17 February 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1998.2901

zbMATH Keywords

Fisher's inequalitySnevily's conjecture\(L\)-intersecting familyBose's theorem

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Extremal set theory (05D05)

Related Items (6)

Improved bounds on families under \(k\)-wise set-intersection constraints ⋮ Uniform hypergraphs under certain intersection constraints between hyperedges ⋮ Families of vector spaces with \(r\)-wise \(\mathcal{L}\)-intersections ⋮ Cross \(\mathcal L\)-intersecting families on set systems ⋮ Set systems with positive intersection sizes ⋮ Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof of Fisher's inequality
• An extension of a Frankl-Füredi theorem
• Intersection theorems with geometric consequences
• Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
• On generalizations of the deBruijn-Erdős theorem
• Proof of a conjecture of Frankl and Füredi
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• Erdös–Ko–Rado Theorem—22 Years Later
• On the decomposition ofkn into complete bipartite graphs
• A Note on Fisher's Inequality for Balanced Incomplete Block Designs
• On some Theorems in Combinatorics Relating to Incomplete Block Designs

This page was built for publication: A generalization of Fisher's inequality