Sets with No Empty Convex 7-Gons
From MaRDI portal
Publication:3670079
DOI10.4153/CMB-1983-077-8zbMath0521.52010OpenAlexW1977266879WikidataQ29394857 ScholiaQ29394857MaRDI QIDQ3670079
Publication date: 1983
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-1983-077-8
Inequalities and extremum problems involving convexity in convex geometry (52A40) Other problems of combinatorial convexity (52A37) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items
Iterated nearest neighbors and finding minimal polytopes ⋮ On some metric and combinatorial geometric problems ⋮ 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 ⋮ Some Erdős-Szekeres type results about points in space ⋮ On empty convex polygons in a planar point set ⋮ Empty monochromatic triangles ⋮ Almost empty monochromatic triangles in planar point sets ⋮ Problems and results in discrete mathematics ⋮ On the Erdös-Szekeres problem ⋮ On empty convex polytopes ⋮ A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets ⋮ On the number of edges in geometric graphs without empty triangles ⋮ Mathematical problems and games ⋮ The maximum size of a convex polygon in a restricted set of points in the plane ⋮ On empty triangles determined by points in the plane ⋮ The approximation algorithms for a class of multiple-choice problem ⋮ An Approximation Algorithm for the Smallest Color-Spanning Circle Problem ⋮ On weighted sums of numbers of convex polygons in point sets ⋮ Drawing the almost convex set in an integer grid of minimum size ⋮ On a partition into convex polygons ⋮ Topologically sweeping an arrangement ⋮ A Ramsey property of order types ⋮ Carathéodory's theorem in depth ⋮ A Ramsey-Type Theorem in the Plane ⋮ On the generalized Erdös-Szekeres conjecture -- a new upper bound ⋮ 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 ⋮ On the Erdős–Szekeres problem in combinatorial geometry ⋮ A Note on the Number of General 4-holes in (Perturbed) Grids ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ 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 ⋮ Chromatic variants of the Erdős--Szekeres theorem on points in convex position. ⋮ On geometric graphs on point sets in the plane ⋮ Point sets with small integer coordinates and no large convex polygons ⋮ Interior points in the Erdős-Szekeres theorems ⋮ Searching for empty convex polygons ⋮ Empty squares in arbitrary orientation among points ⋮ 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 the existence of a point subset with three or five interior points ⋮ Computer solution of the almost empty hexagon problem ⋮ Unnamed Item ⋮ 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 ⋮ Some notes on the Erdős-Szekeres theorem ⋮ Convex independent sets and 7-holes in restricted planar point sets ⋮ On 5-Gons and 5-Holes ⋮ A simple proof for open cups and caps ⋮ Finding minimum area \(k\)-gons ⋮ Cells in any simple polygon formed by a planar point set ⋮ 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 ⋮ Sets in \(\mathbb{R}^ d\) with no large empty convex subsets ⋮ Disjoint empty convex pentagons in planar point sets ⋮ Ramsey-remainder for convex sets and the Erdős-Szekeres theorem ⋮ Empty convex hexagons in planar point sets ⋮ Constructions from empty polygons ⋮ Disjoint empty convex polygons in planar point sets ⋮ Holes in 2-convex point sets ⋮ On the number of disjoint convex quadrilaterals for a planar point set ⋮ 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 ⋮ Around Erdős-Szekeres problems ⋮ More on planar point subsets with a specified number of interior points ⋮ 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 ⋮ Empty pseudo-triangles in point sets ⋮ Alignments closed under a binary product ⋮ On Erdős-Szekeres-type problems ⋮ Many order types on integer grids of polynomial size ⋮ A note on the upper bound for disjoint convex partitions ⋮ The Erdos-Szekeres problem on points in convex position – a survey ⋮ On the existence of a convex point subset containing one triangle in the plane ⋮ Empty triangles in good drawings of the complete graph ⋮ On the empty convex partition of a finite set in the plane. ⋮ Empty triangles in complete topological graphs
