Empty convex hexagons in planar point sets
From MaRDI portal
Publication:2482196
Recommendations
- Empty convex hexagons in planar point sets
- On empty convex polygons in a planar point set
- On empty convex polygons in a planar point set
- Planar point sets with a small number of empty convex polygons
- Disjoint empty convex polygons in planar point sets
- Planar sets with few empty convex polygons
- Empty convex polygons in almost convex sets
- Disjoint empty convex pentagons in planar point sets
- More on empty convex quadrilaterals in a planar point set
Cites work
- Finding sets of points without empty convex 6-gons
- scientific article; zbMATH DE number 3649571 (Why is no real title available?)
- scientific article; zbMATH DE number 3168302 (Why is no real title available?)
- scientific article; zbMATH DE number 3739641 (Why is no real title available?)
- scientific article; zbMATH DE number 1786502 (Why is no real title available?)
- scientific article; zbMATH DE number 5019923 (Why is no real title available?)
- Konvexe Fünfecke in ebenen Punktmengen
- Research Problems in Discrete Geometry
- Sets with No Empty Convex 7-Gons
- The Erdos-Szekeres problem on points in convex position – a survey
Cited in
(73)- On the self crossing six sided figure problem
- On empty convex polytopes
- Drawing the Horton set in an integer grid of minimum size
- Point sets with small integer coordinates and no large convex polygons
- Finding sets of points without empty convex 6-gons
- Large convex holes in random point sets
- Empty rainbow triangles in \(k\)-colored point sets
- A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\)
- A note on the value in the disjoint convex partition problem
- Faster counting empty convex polygons in a planar point set
- On weighted sums of numbers of convex polygons in point sets
- On \(k\)-convex point sets
- Disjoint empty convex pentagons in planar point sets
- On an empty triangle with the maximum area in planar point sets
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
- A superlinear lower bound on the number of 5-holes
- A note on the upper bound for disjoint convex partitions
- Empty triangles in good drawings of the complete graph
- Empty triangles in complete topological graphs
- Lower bounds for the number of small convex \(k\)-holes
- 4-holes in point sets
- Almost empty hexagons
- The empty hexagon theorem
- Pure point diffractive substitution Delone sets have the Meyer property
- On the Erdős-Szekeres \(n\)-interior-point problem
- On the number of edges in geometric graphs without empty triangles
- Empty squares in arbitrary orientation among points
- The Erdős problem for hexagons
- The Erdős-Szekeres Problem
- Almost empty monochromatic triangles in planar point sets
- On empty hexagons
- Empty convex hexagons in planar point sets
- Monochromatic empty triangles in two-colored point sets
- On pseudo-convex partitions of a planar point set
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
- Almost empty polygons
- On balanced 4-holes in bichromatic point sets
- On 5-gons and 5-holes
- Blocking the \(k\)-holes of point sets in the plane
- Intersecting Hexagons in 3-Space
- Specified holes with pairwise disjoint interiors in planar point sets
- On empty convex polygons in a planar point set
- Planar point sets with a small number of empty convex polygons
- On convex holes in d-dimensional point sets
- Holes in 2-convex point sets
- On Erdős-Szekeres-type problems for \(k\)-convex point sets
- Disjoint empty convex polygons in planar point sets
- Holes and islands in random point sets
- Tight bounds on the expected number of holes in random point sets
- Fixing a hole
- A SAT attack on Erdős-Szekeres numbers in \(\mathbb{R}^d\) and the empty hexagon theorem
- Computer solution of the almost empty hexagon problem
- Convex hulls of random order types
- Every large point set contains many collinear points or an empty pentagon
- A SAT attack on higher dimensional Erdős-Szekeres numbers
- On disjoint holes in point sets
- Erdős-Szekeres-type problems in the real projective plane
- Formal verification of the empty hexagon number
- Weights of convex quadrilaterals and empty triangles in weighted point sets
- Erdős-Szekeres maker-breaker games
- Holes in convex and simple drawings
- Almost empty monochromatic polygons in planar point sets
- Automated reasoning for mathematics
- Almost empty monochromatic quadrilaterals in planar point sets
- Erdős-Szekeres maker-breaker games
- The minimum number of peeling sequences of a point set
- Holes in convex and simple drawings
- On the minimum size of a point set containing a 5-hole and double disjoint 3-holes
- Erdős-Szekeres theorem for lines
- Two disjoint 5-holes in point sets
- Empty monochromatic triangles
- On \(k\)-gons and \(k\)-holes in point sets
- On the minimum number of mutually disjoint holes in planar point sets
This page was built for publication: Empty convex hexagons in planar point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482196)
