A Turán-type theorem on chords of a convex polygon (Q1204472): Difference between revisions

The paper proves that the maximum number of straight line segments connecting \(n\) points in convex position in the plane such that no \(k+1\) of them are pairwise crossing is \({n \choose 2}\) if \(n \leq 2k+1\) and \(2kn-{2k+1 \choose 2}\) if \(n \geq 2k+1\).