On a problem in combinatorial geometry

DOI10.1016/0012-365X(83)90183-8zbMath0508.05036OpenAlexW2063407952MaRDI QIDQ5917288

Vojtěch Rödl

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90183-8

zbMATH Keywords

chromatic numberunit spherecomplete subgraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Other problems of combinatorial convexity (52A37)

Related Items (4)

Strong Ramsey properties of simplices ⋮ Finite Euclidean Ramsey theory ⋮ Edge-Ramsey theory ⋮ A Partition Property of Simplices in Euclidean Space

Cites Work

• Intersection theorems with geometric consequences
• A short proof of Kneser's conjecture
• Unnamed Item

This page was built for publication: On a problem in combinatorial geometry