8 citations · 61 across the 28 of their papers we have counts for
40 papers
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…
The Partial List Colouring Conjecture is False
Jonathan A. Noel
We exhibit a graph with vertices and list chromatic number equal to such that there is a -list assignment of such that at most vertices of can be pr…
Orthogonal Pairs in Maps from the Sphere to the Circle
Jonathan A. Noel
We prove that, for any and any , there exist orthogonal vectors such that the length of the shortest arc between and is at…
Sharp bounds for the fractional chromatic number of high-girth -degenerate graphs
Peter Allen, Abhishek Dhawan, Jonathan A. Noel
Martinsson and Steiner recently proved that the fractional chromatic number of any -degenerate triangle-free graph satisfies . They…
On Tournament Anti-Sidorenko Orientations of Trees
Hao Chen, Felix Christian Clemen, Jonathan A. Noel
An oriented graph is said to be tournament anti-Sidorenko if the homomorphism density of in any tournament is bounded above by the homomorphism densit…
Forcing Quasirandomness in a Regular Tournament
Jonathan A. Noel, Arjun Ranganathan, Lina M. Simbaqueba
A tournament is said to force quasirandomness if it has the property that a sequence of tournaments of increasing orders is quasirandom if and only if…