Every large point set contains many collinear points or an empty pentagon (Q659671)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Every large point set contains many collinear points or an empty pentagon |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8726624846458435
0 references
0.7811705470085144
0 references
0.7643548250198364
0 references
0.7607412338256836
0 references
0.7589272856712341
0 references
