On a conjecture of Frankl and Füredi
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Frankl and Füredi conjectured that if ${\cal F} \subset 2^{X}$ is a non-trivial $\lambda$-intersecting family of size $m$, then the number of pairs $\{x,y\} \in \binom{X}{2}$ that are contained in some $F \in {\cal F}$ is at least $\binom{m}{2}$ [P. Frankl and Z. Füredi. A Sharpening of Fisher's Inequality. Discrete Math., 90(1):103-107, 1991]. We verify this conjecture in some special cases, focusing especially on the case where ${\cal F}$ is additionally required to be $k$-uniform and $\lambda$ is small.
@article{10_37236_543,
author = {Ameera Chowdhury},
title = {On a conjecture of {Frankl} and {F\"uredi}},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/543},
zbl = {1232.05148},
url = {http://geodesic.mathdoc.fr/articles/10.37236/543/}
}
Ameera Chowdhury. On a conjecture of Frankl and Füredi. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/543
Cité par Sources :