Sets with No Empty Convex 7-Gons
From MaRDI portal
Publication:3670079
DOI10.4153/CMB-1983-077-8zbMATH Open0521.52010OpenAlexW1977266879WikidataQ29394857 ScholiaQ29394857MaRDI QIDQ3670079FDOQ3670079
Authors: J. D. Horton 
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
Convex sets in (2) dimensions (including convex curves) (52A10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Other problems of combinatorial convexity (52A37)
Cited In (97)
- On the minimum number of mutually disjoint holes in planar point sets
- Some Erdős-Szekeres type results about points in space
- On the number of disjoint convex quadrilaterals for a planar point set
- Point configurations in \(d\)-space without large subsets in convex position
- Two disjoint 5-holes in point sets
- Disjoint empty convex polygons in planar point sets
- The Erdos-Szekeres problem on points in convex position – a survey
- Searching for empty convex polygons
- Problems and results in discrete mathematics
- More on planar point subsets with a specified number of interior points
- On the existence of a convex point subset containing one triangle in the plane
- A Ramsey-Type Theorem in the Plane
- Constructions from empty polygons
- On the empty convex partition of a finite set in the plane.
- On a partition into convex polygons
- Almost empty monochromatic quadrilaterals in planar point sets
- Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
- Almost empty monochromatic triangles in planar point sets
- Monochromatic empty triangles in two-colored point sets
- On \(k\)-gons and \(k\)-holes in point sets
- Disjoint empty convex pentagons in planar point sets
- Specified holes with pairwise disjoint interiors in planar point sets
- On empty triangles determined by points in the plane
- Mathematical problems and games
- Computer solution of the almost empty hexagon problem
- On empty convex polytopes
- Empty monochromatic triangles
- Faster counting empty convex polygons in a planar point set
- Topologically sweeping an arrangement
- On the minimum size of a point set containing a 5-hole and double disjoint 3-holes
- The maximum size of a convex polygon in a restricted set of points in the plane
- On 5-gons and 5-holes
- Iterated nearest neighbors and finding minimal polytopes
- Ramsey-remainder for convex sets and the Erdős-Szekeres theorem
- On empty convex polygons in a planar point set
- Large convex holes in random point sets
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- On the Erdös-Szekeres problem
- On the Erdős–Szekeres problem in combinatorial geometry
- Alignments closed under a binary product
- On the generalized Erdös-Szekeres conjecture -- a new upper bound
- Some notes on the Erdős-Szekeres theorem
- Interior points in the Erdős-Szekeres theorems
- On some metric and combinatorial geometric problems
- The Erdős-Szekeres Problem
- On Erdős-Szekeres-type problems
- A Ramsey property of order types
- Around Erdős-Szekeres problems
- Empty pseudo-triangles in point sets
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations
- On \(k\)-convex point sets
- Erdős-Szekeres theorem for lines
- The approximation algorithms for a class of multiple-choice problem
- On balanced 4-holes in bichromatic point sets
- Lower bounds for the number of small convex \(k\)-holes
- 4-holes in point sets
- Blocking the \(k\)-holes of point sets in the plane
- On the existence of a point subset with three or five interior points
- Almost empty hexagons
- Empty convex hexagons in planar point sets
- Finding minimum area \(k\)-gons
- Every large point set contains many collinear points or an empty pentagon
- A note on the upper bound for disjoint convex partitions
- Convex independent sets and 7-holes in restricted planar point sets
- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
- Cells in any simple polygon formed by a planar point set
- On the number of edges in geometric graphs without empty triangles
- On Erdős-Szekeres-type problems for \(k\)-convex point sets
- On pseudo-convex partitions of a planar point set
- A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\)
- Empty rainbow triangles in \(k\)-colored point sets
- A note on the value in the disjoint convex partition problem
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
- Drawing the Horton set in an integer grid of minimum size
- Empty triangles in good drawings of the complete graph
- Empty triangles in complete topological graphs
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem
- Empty squares in arbitrary orientation among points
- A simple proof for open cups and caps
- A SAT attack on higher dimensional Erdős-Szekeres numbers
- On the Erdős-Szekeres \(n\)-interior-point problem
- Holes and islands in random point sets
- On disjoint holes in point sets
- Tight bounds on the expected number of holes in random point sets
- A SAT attack on Erdős-Szekeres numbers in \(\mathbb{R}^d\) and the empty hexagon theorem
- On weighted sums of numbers of convex polygons in point sets
- Erdős-Szekeres-type problems in the real projective plane
- A superlinear lower bound on the number of 5-holes
- On convex holes in d-dimensional point sets
- Fixing a hole
- Point sets with small integer coordinates and no large convex polygons
- Drawing the almost convex set in an integer grid of minimum size
- A note on the number of general 4-holes in (perturbed) grids
- On geometric graphs on point sets in the plane
- The Mathematics of Ferran Hurtado: A Brief Survey
- Holes in 2-convex point sets
- Many order types on integer grids of polynomial size
This page was built for publication: Sets with No Empty Convex 7-Gons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670079)
