A superlinear lower bound on the number of 5-holes

Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher (Corresponding author), Pavel Valtr, Birgit Vogtenhuber

Research output: Contribution to journalArticleAcademicpeer-review

9 Citations (Scopus)

Abstract

Let P be a finite set of points in the plane in general position, that is, no three points of P are on a common line. We say that a set H of five points from P is a 5-hole in P if H is the vertex set of a convex 5-gon containing no other points of P. For a positive integer n, let h 5(n) be the minimum number of 5-holes among all sets of n points in the plane in general position. Despite many efforts in the last 30 years, the best known asymptotic lower and upper bounds for h 5(n) have been of order Ω(n) and O(n 2), respectively. We show that h 5(n)=Ω(nlog 4/5⁡n), obtaining the first superlinear lower bound on h 5(n). The following structural result, which might be of independent interest, is a crucial step in the proof of this lower bound. If a finite set P of points in the plane in general position is partitioned by a line ℓ into two subsets, each of size at least 5 and not in convex position, then ℓ intersects the convex hull of some 5-hole in P. The proof of this result is computer-assisted.

Original languageEnglish
Article number105236
Number of pages31
JournalJournal of Combinatorial Theory, Series A
Volume173
DOIs
Publication statusPublished - Jul 2020
Externally publishedYes

Funding

Aichholzer, Scheucher, and Vogtenhuber were partially supported by the ESF EUROCORES programme EuroGIGA – CRP ComPoSe, Austrian Science Fund (FWF): I648-N18 . Parada was supported by the Austrian Science Fund (FWF): W1230 . Balko and Valtr were partially supported by the grant GAUK 690214 . Balko, Kynčl, and Valtr were partially supported by the grant no. 18-19158S of the Czech Science Foundation (GAČR) and by the PRIMUS/17/SCI/3 project of Charles University . Balko and Kynčl were partially supported by Charles University project UNCE/SCI/004 . Hackl and Scheucher were partially supported by the Austrian Science Fund (FWF): P23629-N18 . Balko, Scheucher, and Valtr were partially supported by the ERC Advanced Research Grant no 267165 (DISCONV). Scheucher, Parada, and Vogtenhuber were partially supported within the collaborative DACH project Arrangements and Drawings, by grants DFG : FE 340/12-1 and FWF : I 3340-N35 , respectively. The research for this article was partially carried out in the course of the bilateral research project “Erdős–Szekeres type questions for point sets” between Graz and Prague, supported by the OEAD project CZ 18/2015 and project no. 7AMB15A T023 of the Ministry of Education of the Czech Republic .

FundersFunder number
ESF EUROCORES
Univerzita Karlova v PrazeUNCE/SCI/004, P23629-N18
Seventh Framework Programme267165
European Research Council
Deutsche ForschungsgemeinschaftI 3340-N35, FE 340/12-1
Ministerstvo Školství, Mládeže a Tělovýchovy
Grantová Agentura České Republiky
Austrian Science FundGAUK 690214, I648-N18, W1230, 18-19158S

    Keywords

    • Empty k-gon
    • Empty pentagon
    • Erdös–Szekeres type problem
    • Planar point set
    • k-Hole

    Fingerprint

    Dive into the research topics of 'A superlinear lower bound on the number of 5-holes'. Together they form a unique fingerprint.

    Cite this