Every large point set contains many collinear points or an empty pentagon (Q659671): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Zachary R. Abel / rank | |||
| Property / author | |||
| Property / author: Zachary R. Abel / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3100935002 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0904.0262 / rank | |||
Normal rank | |||
Latest revision as of 16:47, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every large point set contains many collinear points or an empty pentagon |
scientific article |
Statements
Every large point set contains many collinear points or an empty pentagon (English)
0 references
24 January 2012
0 references
The paper shows that for every \(k\), a sufficiently large set of points in the plane has \(k\) collinear points or a convex pentagon with no more points in the pentagon or on its boundary. This implies the next open case of a conjecture of \textit{J. Kára, A. Pór} and \textit{D. R. Wood} [Discrete Comput. Geom. 34, No. 3, 497--506 (2005; Zbl 1074.05036)] on ``big line or big clique'' for visibility graphs.
0 references
collinear points
0 references
empty pentagon
0 references
Erdős-Szekeres theorem
0 references
convex position
0 references
big line or big clique conjecture
0 references
empty hexagon
0 references
