Proof of a conjecture of Frankl and Füredi
From MaRDI portal
Publication:1369678
DOI10.1006/jcta.1997.2774zbMath0882.05120OpenAlexW1981753242WikidataQ122917057 ScholiaQ122917057MaRDI QIDQ1369678
Publication date: 1 February 1998
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f4efb1ac7d4734937093a4dac4dc5f9e14c46873
Related Items (10)
On hierarchically closed fractional intersecting families ⋮ Lines in hypergraphs ⋮ Restricted intersecting families on simplicial complex ⋮ On mod-\(p\) Alon-Babai-Suzuki inequality ⋮ Cross \(\mathcal L\)-intersecting families on set systems ⋮ Set systems with \(\mathcal L\)-intersections modulo a prime number ⋮ A generalization of Fisher's inequality ⋮ Multiply intersecting families of sets ⋮ Multilinear polynomials and a conjecture of Frankl and Füredi ⋮ Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families
Cites Work
- 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
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Proof of a conjecture of Frankl and Füredi
