The empty hexagon theorem
From MaRDI portal
Publication:2464368
DOI10.1007/s00454-007-1343-6zbMath1146.52010OpenAlexW2018024429WikidataQ54152673 ScholiaQ54152673MaRDI QIDQ2464368
Publication date: 19 December 2007
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-007-1343-6
Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (45)
Drawing the Horton set in an integer grid of minimum size ⋮ On convex holes in d-dimensional point sets ⋮ Two disjoint 5-holes in point sets ⋮ Empty monochromatic triangles ⋮ Almost empty monochromatic triangles in planar point sets ⋮ On the number of edges in geometric graphs without empty triangles ⋮ On weighted sums of numbers of convex polygons in point sets ⋮ Carathéodory's theorem in depth ⋮ Monochromatic empty triangles in two-colored point sets ⋮ On pseudo-convex partitions of a planar point set ⋮ Holes and islands in random point sets ⋮ Tight bounds on the expected number of holes in random point sets ⋮ Fixing a hole ⋮ On \(k\)-gons and \(k\)-holes in point sets ⋮ On the minimum number of mutually disjoint holes in planar point sets ⋮ Large convex holes in random point sets ⋮ Point sets with small integer coordinates and no large convex polygons ⋮ Empty squares in arbitrary orientation among points ⋮ Lower bounds for the number of small convex \(k\)-holes ⋮ Unnamed Item ⋮ Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1 ⋮ 4-holes in point sets ⋮ Almost empty hexagons ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ On balanced 4-holes in bichromatic point sets ⋮ On 5-Gons and 5-Holes ⋮ Blocking the \(k\)-holes of point sets in the plane ⋮ Empty rainbow triangles in \(k\)-colored point sets ⋮ A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\) ⋮ Specified holes with pairwise disjoint interiors in planar point sets ⋮ A note on the value in the disjoint convex partition problem ⋮ On \(k\)-convex point sets ⋮ Disjoint empty convex pentagons in planar point sets ⋮ Holes in 2-convex point sets ⋮ Almost empty monochromatic quadrilaterals in planar point sets ⋮ On the Erdős-Szekeres \(n\)-interior-point problem ⋮ On almost empty monochromatic triangles and convex quadrilaterals in colored point sets ⋮ On Erdős-Szekeres-type problems for \(k\)-convex point sets ⋮ On the minimum size of a point set containing a 5-hole and double disjoint 3-holes ⋮ Erdős-Szekeres theorem for lines ⋮ A superlinear lower bound on the number of 5-holes ⋮ Faster counting empty convex polygons in a planar point set ⋮ The Erdős-Szekeres Problem ⋮ A note on the upper bound for disjoint convex partitions ⋮ Empty triangles in good drawings of the complete graph
This page was built for publication: The empty hexagon theorem