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 $\pi/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph...
We exhibit a cubic graph with total chromatic number equal to four and list total chromatic number five. This disproves the List Total Colouring Conjecture of Borodin--Kostochka--Woodall, Juvan--Mohar--\v{S}krekovski and Hilton--Johnson from the late 1990s. ChatGPT 6 Astra Ultra discovered the counterexample with littl...
We exhibit a graph $G$ with $14$ vertices and list chromatic number equal to $3$ such that there is a $2$-list assignment $L$ of $G$ such that at most $9$ vertices of $G$ can be properly coloured from $L$. This disproves the Partial List Colouring Conjecture of Albertson, Grossman and Haas. This counterexample was disc...
Martinsson and Steiner recently proved that the fractional chromatic number of any $d$-degenerate triangle-free graph $G$ satisfies $\chi_f(G) = O\left(\frac{d}{\log d}\right)$. They further conjectured a sharp leading constant $1 + o(1)$. In this paper, we confirm their upper bound conjecture for graphs having girth a...
Peter Allen, Abhishek Dhawan, Jonathan A. Noel· arXiv.org· 3 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.