Sets with No Empty Convex 7-Gons
From MaRDI portal
Publication:3670079
Cited in
(97)- A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\)
- Empty rainbow triangles in \(k\)-colored point sets
- On the minimum number of mutually disjoint holes in planar point sets
- Some Erdős-Szekeres type results about points in space
- Point configurations in \(d\)-space without large subsets in convex position
- Two disjoint 5-holes in point sets
- On the number of disjoint convex quadrilaterals for a planar point set
- 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
- Searching for empty convex polygons
- Disjoint empty convex polygons in planar point sets
- Problems and results in discrete mathematics
- The Erdos-Szekeres problem on points in convex position – a survey
- More on planar point subsets with a specified number of interior points
- Constructions from empty polygons
- On the existence of a convex point subset containing one triangle in the plane
- On the empty convex partition of a finite set in the plane.
- A Ramsey-Type Theorem in the Plane
- A simple proof for open cups and caps
- Empty squares in arbitrary orientation among points
- On a partition into convex polygons
- Almost empty monochromatic quadrilaterals in planar point sets
- Almost empty monochromatic triangles in planar point sets
- Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
- 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
- On empty triangles determined by points in the plane
- Mathematical problems and games
- A SAT attack on higher dimensional Erdős-Szekeres numbers
- Specified holes with pairwise disjoint interiors in planar point sets
- Computer solution of the almost empty hexagon problem
- On empty convex polytopes
- On the Erdős-Szekeres \(n\)-interior-point problem
- 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
- Holes and islands in random point sets
- Iterated nearest neighbors and finding minimal polytopes
- On disjoint holes in point sets
- On 5-gons and 5-holes
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- On empty convex polygons in a planar point set
- Large convex holes in random point sets
- Some notes on the Erdős-Szekeres theorem
- On the Erdös-Szekeres problem
- On the generalized Erdös-Szekeres conjecture -- a new upper bound
- On the Erdős–Szekeres problem in combinatorial geometry
- Ramsey-remainder for convex sets and the Erdős-Szekeres theorem
- Interior points in the Erdős-Szekeres theorems
- Alignments closed under a binary product
- Tight bounds on the expected number of holes in random point sets
- On some metric and combinatorial geometric problems
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations
- A Ramsey property of order types
- Around Erdős-Szekeres problems
- Empty pseudo-triangles in point sets
- On weighted sums of numbers of convex polygons in point sets
- The Erdős-Szekeres Problem
- On Erdős-Szekeres-type problems
- A SAT attack on Erdős-Szekeres numbers in \(\mathbb{R}^d\) and the empty hexagon theorem
- Erdős-Szekeres theorem for lines
- The approximation algorithms for a class of multiple-choice problem
- On \(k\)-convex point sets
- A superlinear lower bound on the number of 5-holes
- On balanced 4-holes in bichromatic point sets
- Erdős-Szekeres-type problems in the real projective plane
- Lower bounds for the number of small convex \(k\)-holes
- 4-holes in point sets
- On convex holes in d-dimensional point sets
- Fixing a hole
- Point sets with small integer coordinates and no large convex polygons
- Blocking the \(k\)-holes of point sets in the plane
- 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 the existence of a point subset with three or five interior points
- Almost empty hexagons
- Finding minimum area \(k\)-gons
- Empty convex hexagons in planar point sets
- On geometric graphs on point sets in the plane
- Every large point set contains many collinear points or an empty pentagon
- Convex independent sets and 7-holes in restricted planar point sets
- A note on the upper bound for disjoint convex partitions
- The Mathematics of Ferran Hurtado: A Brief Survey
- 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 pseudo-convex partitions of a planar point set
- Holes in 2-convex point sets
- On Erdős-Szekeres-type problems for \(k\)-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)
