The Erdös-Ko-Rado Theorem for Small Families
暂无分享,去创建一个
Abstract Let t be a fixed positive integer and c a real constant, 0 1 2 . We prove that for n sufficiently large each family A of cn-element subsets of [n] having | A | = n contains a t-intersecting subfamily A ′ ⊆ A with | A ′|>/ cn(1 − o(1)).
[1] E. Szemerédi. Regular Partitions of Graphs , 1975 .
[2] Vojtech Rödl,et al. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent , 1986, Graphs Comb..
[3] P. Erdös,et al. INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .