Intersection theorems for triangles
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:BCGSNEIFrecord.jsonopen to challenge →
classification
math.CO
cs.DM
keywords
familytrianglesintersectinggivenpointssetsverticesbinom
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.