paper

Orthogonal Pairs in Maps from the Sphere to the Circle

arXiv:2609.22680

Abstract

We prove that, for any and any , there exist orthogonal vectors such that the length of the shortest arc between and is at most . This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

arXiv comment10 pages, 1 figure