Regularity conditions and intersecting hypergraphs
HTML articles powered by AMS MathViewer
- by Peter Frankl PDF
- Proc. Amer. Math. Soc. 82 (1981), 309-311 Request permission
Abstract:
Let $(\mathcal {F},X)$ be a hypergraph with a transitive group of automorphisms. Suppose further that any four edges of $\mathcal {F}$ intersect nontrivially. Denoting $\left | X \right |$ by $n$ we prove $\left | \mathcal {F} \right | = O({2^n})$. We show as well that it is not sufficient to suppose regularity instead of the transitivity of $\operatorname {Aut} (\mathcal {F})$.References
- Alan Brace and D. E. Daykin, A finite set covering theorem. I, II, Bull. Austral. Math. Soc. 5 (1971), 197–202; ibid. 6 (1972), 19–24. MR 292691, DOI 10.1017/S0004972700047067
- P. Erdős, Chao Ko, and R. Rado, Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. (2) 12 (1961), 313–320. MR 140419, DOI 10.1093/qmath/12.1.313
- Péter Frankl, Families of finite sets satisfying an intersection condition, Bull. Austral. Math. Soc. 15 (1976), no. 1, 73–79. MR 460131, DOI 10.1017/S0004972700036777
Additional Information
- © Copyright 1981 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 82 (1981), 309-311
- MSC: Primary 05C65; Secondary 05A05, 05C25
- DOI: https://doi.org/10.1090/S0002-9939-1981-0609674-1
- MathSciNet review: 609674