论文标题
三角形的交集定理
Intersection theorems for triangles
论文作者
论文摘要
鉴于飞机上的一系列套装，我们说该家庭正在相交，如果他们的室内室内两组相交。在本文中，我们在给定的一组点中研究了与顶点的相交家族。特别是，我们表明，如果$ n $点的一组$ p $处于凸位置，那么最大的三个三角形家族与$ p $中的顶点家族最多包含$（\ frac {1} {4} {4}+o（1）+o（1））
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.
