Borsuk's problem and the chromatic numbers of metric spaces

DOI10.1016/j.endm.2007.01.040zbMath1291.05072OpenAlexW2036877658MaRDI QIDQ3439594

Andrei M. Raigorodskii

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.040

zbMATH Keywords

geometric graphsRamsey numberschromatic numbersdistance graphsBorsuk's problempartitions of sets

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Generalized Ramsey theory (05C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
• Intersection theorems with geometric consequences
• Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
• The Borsuk partition problem: the seventieth anniversary
• On the Borsuk and Erdős-Hadwiger numbers
• Excursions into combinatorial geometry
• Mitteilung betreffend meine Note: Überdeckung einer Menge durch Mengen kleineren Durchmessers
• Borsuk's problem and the chromatic numbers of some metric spaces
• A counterexample to Borsuk’s conjecture
• Illuminating sets of constant width
• On the chromatic number of a space
• On lower bounds for Borsuk and Hadwiger numbers
• The chromatic number of a space with the metric $ l_q$
• On a bound in Borsuk's problem
• The connection between the Borsuk and Erdös-Hadwiger problems
• 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: Borsuk's problem and the chromatic numbers of metric spaces