A superlinear lower bound on the number of 5-holes

DOI10.4230/LIPIcs.SoCG.2017.8zbMath1432.52027arXiv1703.05253OpenAlexW2964317353MaRDI QIDQ4580080

Jan Kynčl, Oswin Aichholzer, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber, Pavel Valtr, Martin Balko, Thomas Hackl

Publication date: 13 August 2018

Full work available at URL: https://arxiv.org/abs/1703.05253

zbMATH Keywords

Erdős-Szekeres-type problemempty pentagon\(k\)-holeplanar point setempty \(k\)-gon

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Combinatorial complexity of geometric structures (52C45) Computer assisted proofs of proofs-by-exhaustion type (68V05)

Related Items (3)

Two disjoint 5-holes in point sets ⋮ Empty rainbow triangles in \(k\)-colored point sets ⋮ A superlinear lower bound on the number of 5-holes

This page was built for publication: A superlinear lower bound on the number of 5-holes