Publications
Publications
- Graphs and Combinatorics
Every Large Point Set Contains Many Collinear Points or an Empty Pentagon
By: Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmović, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór and David Wood
Abstract
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].
Keywords
Erdős-Szekeres Theorem; Happy End Problem; Big Line Or Big Clique Conjecture; Empty Quadrilateral; Empty Pentagon; Empty Hexagon
Citation
Abel, Zachary, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmović, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, and David Wood. "Every Large Point Set Contains Many Collinear Points or an Empty Pentagon." Graphs and Combinatorics 27, no. 1 (January 2011): 47–60.
About The Author
