论文信息 - Intersection theorems for triangles

Intersection theorems for triangles

Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In particular, we show that if a set $P$ of $n$ points is in convex position, then the largest intersecting family of triangles with vertices in $P$ contains at most $(\frac{1}{4}+o(1))\binom{n}{3}$ triangles.

Peter Frankl | Andrey Kupavskii | Andreas Holmsen

[1] W. N. Hsieh,et al. Intersection theorems for systems of finite vector spaces , 1975, Discret. Math..

[2] Imre Bárány,et al. A generalization of carathéodory's theorem , 1982, Discret. Math..

[3] Z. Füredi,et al. The number of triangles covering the center of an n-set , 1984 .

[4] I. James,et al. Singularities * , 2008 .

[5] Boris Bukh. A Point in Many Triangles , 2006, Electron. J. Comb..

[6] Emo Welzl,et al. A Continuous Analogue of the Upper Bound Theorem , 2001, Discret. Comput. Geom..

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

[8] Jirí Matousek,et al. Stabbing Simplices by Points and Flats , 2008, Discret. Comput. Geom..

[9] Peter Frankl,et al. The Erdös-Ko-Rado theorem for vector spaces , 1986, J. Comb. Theory, Ser. A.

[10] Peter Frankl,et al. On the Maximum Number of Permutations with Given Maximal or Minimal Distance , 1977, J. Comb. Theory, Ser. A.

[11] Roman N. Karasev,et al. A Simpler Proof of the Boros–Füredi–Bárány–Pach–Gromov Theorem , 2010, Discret. Comput. Geom..