A Turán-type theorem on chords of a convex polygon (Q1204472): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:12, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Turán-type theorem on chords of a convex polygon |
scientific article |
Statements
A Turán-type theorem on chords of a convex polygon (English)
0 references
10 March 1993
0 references
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\).
0 references
chords
0 references
convex polygon
0 references
maximum number
0 references
straight line segments
0 references
