A Turán-type theorem on chords of a convex polygon (Q1204472): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Alan C. Tucker / rank | |||
Property / reviewed by | |||
Property / reviewed by: Alan C. Tucker / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Disjoint edges in geometric graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3852212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the chromatic number of multiple interval graphs and overlap graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Covering and coloring problems for relatives of intervals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048864 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3676164 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring a Family of Circular Arcs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the theory of graphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0095-8956(92)90003-g / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2068020662 / rank | |||
Normal rank |
Latest revision as of 11:55, 30 July 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