scientific article; zbMATH DE number 1786502
From MaRDI portal
Publication:4547794
zbMath0998.52004MaRDI QIDQ4547794
Publication date: 21 August 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2098/20980091
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Erd?s problems and related topics of discrete geometry (52C10) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Related Items (23)
Two disjoint 5-holes in point sets ⋮ On empty convex polygons in a planar point set ⋮ Erdős--Szekeres theorem with forbidden order types ⋮ Erdős-Szekeres without induction ⋮ A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets ⋮ Many empty triangles have a common edge ⋮ Erdős-Szekeres theorem for \(k\)-flats ⋮ A Note on the Number of General 4-holes in (Perturbed) Grids ⋮ Stars of empty simplices ⋮ Chromatic variants of the Erdős--Szekeres theorem on points in convex position. ⋮ Erdős-Szekeres theorem for point sets with forbidden subconfigurations ⋮ Lower bounds for the number of small convex \(k\)-holes ⋮ Point configurations in \(d\)-space without large subsets in convex position ⋮ On 5-Gons and 5-Holes ⋮ Cells in any simple polygon formed by a planar point set ⋮ Specified holes with pairwise disjoint interiors in planar point sets ⋮ Moments of the maximal number of empty simplices of a random point set ⋮ Empty convex hexagons in planar point sets ⋮ Obstacle numbers of graphs ⋮ Regular systems of paths and families of convex sets in convex position ⋮ Erdős-Szekeres theorem for lines ⋮ A superlinear lower bound on the number of 5-holes ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\)
This page was built for publication:
