Planar sets with few empty convex polygons
From MaRDI portal
Publication:2714367
DOI10.1556/SScMath.36.2000.1-2.9zbMath0980.52007MaRDI QIDQ2714367
Publication date: 13 June 2001
Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)
Erd?s problems and related topics of discrete geometry (52C10) Other problems of combinatorial convexity (52A37)
Related Items
Drawing the Horton set in an integer grid of minimum size, The number of empty four-gons in random point sets, On empty convex polygons in a planar point set, Empty monochromatic triangles, Almost empty monochromatic triangles in planar point sets, Carathéodory's theorem in depth, Chromatic variants of the Erdős--Szekeres theorem on points in convex position., Empty squares in arbitrary orientation among points, Every large point set contains many collinear points or an empty pentagon, Empty rainbow triangles in \(k\)-colored point sets, Empty monochromatic simplices, Large Area Convex Holes in Random Point Sets, Faster counting empty convex polygons in a planar point set, Empty pseudo-triangles in point sets, The Erdos-Szekeres problem on points in convex position – a survey
