Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
From MaRDI portal
Publication:1201240
DOI10.1016/0012-365X(92)90665-3zbMath0766.52003OpenAlexW2012104218MaRDI QIDQ1201240
Publication date: 17 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90665-3
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Designs and configurations (05B99)
Related Items
On convex holes in d-dimensional point sets, Some Erdős-Szekeres type results about points in space, On empty convex polytopes, Holes and islands in random point sets, Tight bounds on the expected number of holes in random point sets, Tropical combinatorial Nullstellensatz and sparse polynomials, Fixing a hole, Chromatic variants of the Erdős--Szekeres theorem on points in convex position., Point configurations in \(d\)-space without large subsets in convex position, Unnamed Item, Ramsey-remainder for convex sets and the Erdős-Szekeres theorem, Holes in 2-convex point sets, On Erdős-Szekeres-type problems for \(k\)-convex point sets, A superlinear lower bound on the number of 5-holes, Convex polygons in Cartesian products, The Erdős-Szekeres Problem, The Erdos-Szekeres problem on points in convex position – a survey
Cites Work
