Empty rainbow triangles in \(k\)-colored point sets
From MaRDI portal
Publication:1984595
DOI10.1016/j.comgeo.2020.101731OpenAlexW3108058852MaRDI QIDQ1984595
Ana Laura Trujillo-Negrete, Daniel Perz, Ruy Fabila-Monroy
Publication date: 16 September 2021
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.07863
Related Items (1)
Cites Work
- Almost empty monochromatic triangles in planar point sets
- Monochromatic empty triangles in two-colored point sets
- On balanced 4-holes in bichromatic point sets
- Almost empty monochromatic quadrilaterals in planar point sets
- Empty monochromatic triangles
- On empty triangles determined by points in the plane
- Convex independent sets and 7-holes in restricted planar point sets
- Konvexe Fünfecke in ebenen Punktmengen
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- Lower bounds for the number of small convex \(k\)-holes
- The empty hexagon theorem
- Empty convex hexagons in planar point sets
- Planar sets with few empty convex polygons
- On Erdős-Szekeres-type problems
- Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
- Sets with No Empty Convex 7-Gons
- Empty Simplices in Euclidean Space
- A superlinear lower bound on the number of 5-holes
- A Note on the Number of Empty Triangles
- Planar point sets with a small number of empty convex polygons
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Empty rainbow triangles in \(k\)-colored point sets