On the Borsuk and Erdős-Hadwiger numbers

DOI10.1007/s11006-006-0096-5zbMath1133.05032OpenAlexW1971581112MaRDI QIDQ2473700

Andrei M. Raigorodskii

Publication date: 4 March 2008

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11006-006-0096-5

zbMATH Keywords

chromatic numberBorsuk problemBorsuk numberindependence number of a graphErdős-Hadwiger problemcoloring Euclidean spaceErdős-Hadwiger number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

On Ramsey Type Problems in Combinatorial Geometry ⋮ Partition of three-dimensional sets into five parts of smaller diameter ⋮ On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem ⋮ Borsuk's problem and the chromatic numbers of metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection theorems with geometric consequences
• Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
• The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
• Borsuk's problem and the chromatic numbers of some metric spaces
• A counterexample to Borsuk’s conjecture
• On the chromatic number of a space
• On lower bounds for Borsuk and Hadwiger numbers
• On a bound in Borsuk's problem
• Drei Sätze über die n-dimensionale euklidische Sphäre
• Covering a sphere with spheres
• The realization of distances within sets in Euclidean space
• The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs

This page was built for publication: On the Borsuk and Erdős-Hadwiger numbers