The connection between the Borsuk and Erdös-Hadwiger problems

DOI10.1070/RM2005V060N04ABEH003679MaRDI QIDQ5460477zbMATH OpenFDO

Authors Andrei M. Raigorodskii

Publication date 28 April 2008

Published in Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/RM2005V060N04ABEH003679

Mathematics Subject Classification ID

Partitions of sets (05A18) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Extremal set theory (05D05) Other problems of combinatorial convexity (52A37) Erd?s problems and related topics of discrete geometry (52C10)

Recommendations

• On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems
• On the Borsuk and Erdős-Hadwiger numbers
• The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
• Borsuk's problem and the chromatic numbers of some metric spaces
• scientific article; zbMATH DE number 6536189

Cited in

(10)

• 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
• On the Borsuk and Erdős-Hadwiger numbers
• On the chromatic number of Euclidean space and the Borsuk problem
• On a series of Ramsey-type problems in combinatorial geometry
• Around Borsuk's hypothesis
• Coloring distance graphs and graphs of diameters
• Borsuk's problem and the chromatic numbers of metric spaces
• On Ramsey Type Problems in Combinatorial Geometry
• On lower bounds for Borsuk and Hadwiger numbers
• On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems

This page was built for publication: The connection between the Borsuk and Erdös-Hadwiger problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5460477)