论文信息 - The maximum size of 3-wise t-intersecting families

The maximum size of 3-wise t-intersecting families

Let t ≥ 26 and let F be a k-uniform hypergraph on n vertices. Suppose that |F1 ∩ F2 ∩ F3| ≥ t holds for all F1, F2, F3 ∈ F. We prove that the size of F is at most (n-t k-t) ifp = k/n satisfies p ≤ 2/√4t+9-1 and n is sufficiently large. The above inequality for p is the best possible.

Norihide Tokushige

[1] Rudolf Ahlswede,et al. The Complete Intersection Theorem for Systems of Finite Sets , 1997, Eur. J. Comb..

[2] Norihide Tokushige. The maximum size of 4-wise 2-intersecting and 4-wise 2-union families , 2006, Eur. J. Comb..

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

[4] Peter Frankl. Families of finite sets satisfying an intersection condition , 1976, Bulletin of the Australian Mathematical Society.

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