On rational analogs of Nelson-Hadwiger's and Borsuk's problems

DOI10.22405/2226-8383-2018-19-3-270-281MaRDI QIDQ5109697zbMATH OpenOpenAlexFDO

Authors Artem A. Sokolov, Andrei M. Raigorodskii

Publication date 13 May 2020

Published in Чебышевский сборник (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://mathnet.ru/eng/cheb694

zbMATH Keywords

chromatic numberBorsuk's problemunit-distance graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Borsuk's problem and the chromatic numbers of some metric spaces
• On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems
• Around Borsuk's hypothesis
• On the Borsuk and Erdős-Hadwiger numbers
• Borsuk's problem and the chromatic numbers of metric spaces

Cited in

(3)

• A Special Case of Rational Identity Testing and the Brešar-Klep Theorem.
• Chromatic numbers of distance graphs without short odd cycles in rational spaces
• Bounds on Borsuk numbers in distance graphs of a special type

This page was built for publication: On rational analogs of Nelson-Hadwiger's and Borsuk's problems

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