Work

Orthogonal Pairs in Maps from the Sphere to the Circle

Year: 2026
Type: preprint
Abstract: We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.
Language: English
Open Access status: green
OpenAlex ID: W7214007936
Cites: 2
Cited by:
Related to: 10