Empty monochromatic simplices

DOI10.1007/s00454-013-9565-2zbMath1294.05194DBLPjournals/dcg/AichholzerMHHU14arXiv1210.7043OpenAlexW2140117897WikidataQ61732474 ScholiaQ61732474MaRDI QIDQ2250050

Jorge Urrutia, Thomas Hackl, Clemens Huemer, Ruy Fabila-Monroy, Oswin Aichholzer

Publication date: 4 July 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.7043

zbMATH Keywords

simplicial complexcolored point setsempty monochromatic simpliceshigh dimensional triangulations

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10) Combinatorial aspects of simplicial complexes (05E45)

Related Items (3)

Discrete geometry on colored point sets in the plane -- a survey ⋮ 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
• Empty monochromatic triangles
• On triangulations of the convex hull of n points
• On empty triangles determined by points in the plane
• Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
• A proof of the lower bound conjecture for convex polytopes
• Tetrahedrizing point sets in three dimensions
• A decomposition theorem for partially ordered sets
• Planar sets with few empty convex polygons
• Research Problems in Discrete Geometry
• Empty Simplices in Euclidean Space
• The maximum numbers of faces of a convex polytope
• Planar point sets with a small number of empty convex polygons
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

This page was built for publication: Empty monochromatic simplices