Almost empty monochromatic triangles in planar point sets
From MaRDI portal
Publication:299089
DOI10.1016/j.dam.2015.05.033zbMath1339.05040arXiv1410.0424OpenAlexW2034126497MaRDI QIDQ299089
Deepan Basu, Sandip Das, Bhaswar B. Bhattacharya, Kinjal Basu
Publication date: 22 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.0424
Related Items (3)
Empty rainbow triangles in \(k\)-colored point sets ⋮ A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\) ⋮ Almost empty monochromatic quadrilaterals in planar point sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monochromatic empty triangles in two-colored point sets
- Computer solution of the almost empty hexagon problem
- Empty monochromatic triangles
- On \(k\)-gons and \(k\)-holes in point sets
- Konvexe Fünfecke in ebenen Punktmengen
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- On the Erdös-Szekeres problem
- Lower bounds for the number of small convex \(k\)-holes
- Almost empty hexagons
- The empty hexagon theorem
- Empty convex hexagons in planar point sets
- Planar sets with few empty convex polygons
- Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
- Plane Graphs with Parity Constraints
- Computer solution to the 17-point Erdős-Szekeres problem
- Sets with No Empty Convex 7-Gons
- Almost empty polygons
- Planar point sets with a small number of empty convex polygons
This page was built for publication: Almost empty monochromatic triangles in planar point sets
