scientific article; zbMATH DE number 3649571
From MaRDI portal
Publication:3207683
Cited in
(50)- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
- scientific article; zbMATH DE number 3668647 (Why is no real title available?)
- On disjoint holes in point sets
- On the minimum number of mutually disjoint holes in planar point sets
- scientific article; zbMATH DE number 3167519 (Why is no real title available?)
- The Erdős-Szekeres Problem
- On Erdős-Szekeres-type problems
- Points defining triangles with distinct circumradii
- Blocking the \(k\)-holes of point sets in the plane
- Two disjoint 5-holes in point sets
- A superlinear lower bound on the number of 5-holes
- Empty triangles in good drawings of the complete graph
- On Erdős-Szekeres-type problems for \(k\)-convex point sets
- scientific article; zbMATH DE number 3961669 (Why is no real title available?)
- Convex polygons in geometric triangulations
- Drawing the almost convex set in an integer grid of minimum size
- Almost empty hexagons
- Large convex holes in random point sets
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- A SAT attack on higher dimensional Erdős-Szekeres numbers
- Point sets with small integer coordinates and no large convex polygons
- A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\)
- Empty rainbow triangles in \(k\)-colored point sets
- Fixing a hole
- Empty squares in arbitrary orientation among points
- On the minimum size of a point set containing a 5-hole and double disjoint 3-holes
- On the Erdős–Szekeres problem in combinatorial geometry
- Faster counting empty convex polygons in a planar point set
- Empty convex hexagons in planar point sets
- Drawing the Horton set in an integer grid of minimum size
- Disjoint empty convex pentagons in planar point sets
- On pseudo-convex partitions of a planar point set
- Almost empty monochromatic quadrilaterals in planar point sets
- Lower bounds for the number of small convex \(k\)-holes
- 4-holes in point sets
- Convex Polygons in Geometric Triangulations
- Erdős-Szekeres-type problems in the real projective plane
- On \(k\)-gons and \(k\)-holes in point sets
- Holes in 2-convex point sets
- Tight bounds on the expected number of holes in random point sets
- On balanced 4-holes in bichromatic point sets
- A SAT attack on Erdős-Szekeres numbers in \(\mathbb{R}^d\) and the empty hexagon theorem
- On the number of edges in geometric graphs without empty triangles
- On \(k\)-convex point sets
- The Erdos-Szekeres problem on points in convex position – a survey
- Almost empty monochromatic triangles in planar point sets
- On geometric graphs on point sets in the plane
- Convex polygons in Cartesian products
- Nineteen problems on elementary geometry
- Holes and islands in random point sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3207683)
