Jonathan A. Noel

activity

20122026

most citedNon-bipartite k-common graphs

8 citations · 61 across the 28 of their papers we have counts for

collaborators

Showing 2026Show all

5 papers · 1 filter

math.CO2026

The List Total Colouring Conjecture is False

Jonathan A. Noel

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--W…

math.CO2026

The Partial List Colouring Conjecture is False

Jonathan A. Noel

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 pr…

math.CO2026

Orthogonal Pairs in Maps from the Sphere to the Circle

Jonathan A. Noel

We prove that, for any $f : S^{2} \to S^{1}$ and any $ε > 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…

math.CO2026

Sharp bounds for the fractional chromatic number of high-girth $d$ -degenerate graphs

Peter Allen, Abhishek Dhawan, Jonathan A. Noel

Martinsson and Steiner recently proved that the fractional chromatic number of any $d$ -degenerate triangle-free graph $G$ satisfies $χ_{f} (G) = O (\frac{d}{l o g d})$ . They…

math.CO2026

On Tournament Anti-Sidorenko Orientations of Trees

Hao Chen, Felix Christian Clemen, Jonathan A. Noel

An oriented graph $H$ is said to be tournament anti-Sidorenko if the homomorphism density of $H$ in any tournament $T$ is bounded above by the homomorphism densit…

The List Total Colouring Conjecture is False

The Partial List Colouring Conjecture is False

Orthogonal Pairs in Maps from the Sphere to the Circle

Sharp bounds for the fractional chromatic number of high-girth d-degenerate graphs

On Tournament Anti-Sidorenko Orientations of Trees

Sharp bounds for the fractional chromatic number of high-girth $d$ -degenerate graphs