On almost empty monochromatic triangles and convex quadrilaterals in colored point sets

DOI10.1007/S00373-019-02081-8zbMath1431.05030OpenAlexW2971635682WikidataQ127321347 ScholiaQ127321347MaRDI QIDQ2287740

Jorge Urrutia, Alejandro Corinto González-Martínez, Toshinori Sakai, Jorge Cravioto-Lagos

Publication date: 21 January 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02081-8

zbMATH Keywords

convex decompositionmonochromatic trianglecolored point setalmost emptyflippable edgemonochromatic convex quadrilateral

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10) Other problems of combinatorial convexity (52A37) Ramsey theory (05D10)

Related Items (2)

On rainbow quadrilaterals in colored point sets ⋮ A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monochromatic empty triangles in two-colored point sets
• Blocking the \(k\)-holes of point sets in the plane
• Empty monochromatic triangles
• On \(k\)-gons and \(k\)-holes in point sets
• On convex decompositions of a planar point set
• On empty triangles determined by points in the plane
• Konvexe Fünfecke in ebenen Punktmengen
• Characterizing and efficiently computing quadrangulations of planar point sets
• Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
• Flipping edges in triangulations
• A note on convex decompositions of a set of points in the plane
• Covering the convex quadrilaterals of point sets
• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• 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
• SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
• Almost empty polygons
• Simultaneously Flippable Edges in Triangulations
• Simultaneous diagonal flips in plane triangulations
• Minimum convex partition of a constrained point set

This page was built for publication: On almost empty monochromatic triangles and convex quadrilaterals in colored point sets