The maximum size of 3-wise t-intersecting families

Authors:
Norihide Tokushige
Affiliations:
College of Education, Ryukyu University, Nishihara, Okinawa, Japan
Venue:
European Journal of Combinatorics
Year:
2007

Citing 2
Cited 4

The complete intersection theorem for systems of finite sets

European Journal of Combinatorics
The maximum size of 4-wise 2-intersecting and 4-wise 2-union families

European Journal of Combinatorics

EKR type inequalities for 4-wise intersecting families

Journal of Combinatorial Theory Series A
Multiply-intersecting families revisited

Journal of Combinatorial Theory Series B
A product version of the Erdős-Ko-Rado theorem

Journal of Combinatorial Theory Series A
The maximum size of intersecting and union families of sets

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.