Every large point set contains many collinear points or an empty pentagon

We prove the following generalised empty pentagon theorem for every integer ℓ ≥ 2, every sufficiently large set of points in the plane contains ℓ collinear points or an empty pentagon. As an application, we settle the next open case of the “big line or big clique” conjecture of Kára, Pór, and Wood [Discrete Comput. Geom. 34(3):497–506, 2005].

CitationAbel, Z. [et al.]. Every large point set contains many collinear points or an empty pentagon. "Graphs and combinatorics", Gener 2011, vol. 27, núm. 1, p. 47-60.

URIhttp://hdl.handle.net/2117/11669

DOI10.1007/s00373-010-0957-2

ISSN0911-0119

Publisher versionhttp://arxiv.org/PS_cache/arxiv/pdf/0904/0904.0262v2.pdf

Collections

View Usage Statistics

Show full item record

Files	Description	Size	Format	View
large_point_set.pdf		221,7Kb	PDF	Restricted access

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder

UPCommons. Global access to UPC knowledge

Every large point set contains many collinear points or an empty pentagon

View/Open

Browse