Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons

DOI10.1137/090767947zbMath1204.52017OpenAlexW1974558861WikidataQ61732483 ScholiaQ61732483MaRDI QIDQ3058550

Birgit Vogtenhuber, Oswin Aichholzer, Clemens Huemer, Ferran Hurtado, Thomas Hackl

Publication date: 3 December 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/6394

zbMATH Keywords

Erdős-Szekeres theoremcolored point setsempty polygonsmonochromatic \(k\)-gons

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items

Empty monochromatic triangles ⋮ Almost empty monochromatic triangles in planar point sets ⋮ Plane Graphs with Parity Constraints ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Monochromatic empty triangles in two-colored point sets ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ On geometric graphs on point sets in the plane ⋮ Plane graphs with parity constraints ⋮ On balanced 4-holes in bichromatic point sets ⋮ Parity-constrained triangulations with Steiner points ⋮ 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 ⋮ On almost empty monochromatic triangles and convex quadrilaterals in colored point sets