Abstract:
Borsuk's celebrated conjecture, which has been disproved, can be stated as follows: in Rn, there exist no diameter graphs with chromatic number larger than n+1. In this paper, we prove the existence of counterexamples to Borsuk's conjecture which, in addition, have large girth. This study is in the spirit of O'Donnell and Kupavskii, who studied the existence of distance graphs with large girth. We consider both cases of strict and nonstrict diameter graphs. We also prove the existence of counterexamples with large girth to a statement of Lovász concerning distance graphs on the sphere.
This work was supported
by the program “Leading Scientific Schools”
under grant NSh-6760.2018.1
and by the Swiss National Science Foundation under grant SNSF-200021_169391.
Citation:
R. I. Prosanov, “Counterexamples to Borsuk's Conjecture with Large Girth”, Mat. Zametki, 105:6 (2019), 890–898; Math. Notes, 105:6 (2019), 874–880