Abstract
Let be an n-uniform hypergraph on 2n vertices. Suppose that
and
holds for all F1,F2,F3 ∈
. We prove that the size of
is at most
.
Similar content being viewed by others
References
Engel, K., Gronau, H.-D.O.F.: An Erdős–Ko–Rado type theorem II. Acta Cybernet. 4, 405–411 (1986)
Erdős, P., Ko, C., Rado, R.: Intersection theorems for systems of finite sets. Quart. J. Math. Oxford (2) 12, 313–320 (1961)
Frankl, P.: On Sperner families satisfying an additional condition. J. Combin. Theory (A) 20, 1–11 (1976)
Frankl, P., Tokushige, N.: Weighted 3-wise 2-intersecting families. J. Combin. Theory (A) 100, 94–115 (2002)
Frankl, P., Tokushige, N.: Random walks and multiply intersecting families. J. Combin. Theory (A) 109, 121–134 (2005)
Gronau, H.-D.O.F.: An Erdős–Ko–Rado type theorem. Finite and infinite sets, Vol. I, II (Eger, 1981). Colloq Math Soc J Bolyai 37, 333–342 (1984)
Tokushige, N.: A frog's random jump and the Pólya identity. Ryukyu Math Journal 17, 89–103 (2004)
Tokushige, N.: The maximum size of 4-wise 2-intersecting and 4-wise 2-union families. European J. Combin (in press)
Author information
Authors and Affiliations
Corresponding author
Additional information
The second author was supported by MEXT Grant-in-Aid for Scientific Research (B) 16340027
Rights and permissions
About this article
Cite this article
Frankl, P., Tokushige, N. The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families. Graphs and Combinatorics 22, 225–231 (2006). https://doi.org/10.1007/s00373-006-0655-2
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00373-006-0655-2