论文信息 - A note on supersaturated set systems

A note on supersaturated set systems

A well-known theorem of Erd?s, Ko and Rado implies that any family? ? of k -element subsets of an n -element set with more than? n - t k - t members must contain two members? F and? F ' with | F ? F ' | < t , as long as? n is sufficiently large with respect to? k and? t . We investigate how many such pairs? ( F , F ' ) ? ? × ? there must be in any such family? ? with? | ? | = α n - t k - t and? α 1 .

Yoshiharu Kohayakawa | Vojtech Rödl | Peter Frankl

[1] Béla Bollobás,et al. Set Systems with few Disjoint Pairs , 2003, Comb..

[2] J. Pintz,et al. The Difference Between Consecutive Primes, II , 2001 .

[3] P. Erdös,et al. INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .

[4] Benny Sudakov,et al. The minimum number of disjoint pairs in set systems and related problems , 2016, Comb..

[5] Zoltán Füredi,et al. A new short proof of the EKR theorem , 2012, J. Comb. Theory, Ser. A.

[6] Richard M. Wilson,et al. The exact bound in the Erdös-Ko-Rado theorem , 1984, Comb..

[7] Vojtech Rödl,et al. On a Packing and Covering Problem , 1985, Eur. J. Comb..

[8] J. Pintz,et al. The Difference Between Consecutive Primes , 1996 .

[9] Nikolai N. Kuzjurin,et al. On the difference between asymptotically good packings and coverings , 1995, Eur. J. Comb..

[10] Rudolf Ahlswede,et al. Simple hypergraphs with maximal number of adjacent pairs of edges , 1980, J. Comb. Theory, Ser. B.

[11] Peter Frankl. On the Minimum Number of Disjoint Pairs in a Family of Finite Sets , 1977, J. Comb. Theory, Ser. A.