Frankl and Furedi conjectured that given a family J of subsets of [n] such that 1 <= |E intersect F| <= k for all distinct E and f in J. we must have |J| <= #SIGMA#_(i=0)~k (_i~(n - 1)), (1981, P. Frankl and Z. Furedi, Collog. Math. Soc. Janos Bolyai 37, 305 320). The first proof of this result was given by G. V. Ramanan in (1997, J. Combin. Ser. A 79, 53 67). In this note, we present a proof which is a modification of an approach to this problem by H. Snevily (1994, J. Combin. Ser. A. 68, 232 238) and like Snevily's, is based on the technique of N. Alon, L. Babai, and H. Suzuki (1991, J. Combin, Theory Ser. A 58, 165 180).
展开▼
