From the 1 of 7 linked papers with an AI index.
7 papers
Sharp bounds for the fractional chromatic number of high-girth -degenerate graphs
Peter Allen, Abhishek Dhawan, Jonathan A. Noel
The paper proves tight upper and lower bounds of order d/log d for the fractional chromatic number of high‑girth d‑degenerate graphs, provides a randomized algorithm achieving the…
Off-Diagonal Ramsey Multiplicity
Elena Moss, Jonathan A. Noel
The Ramsey multiplicity problem asks for the minimum asymptotic density of monochromatic labelled copies of a graph in a red/blue colouring of the edges of . We introduce…
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…
Disconnected Common Graphs via Supersaturation
Jae-baek Lee, Jonathan A. Noel
A graph is said to be common if the number of monochromatic labelled copies of in a -colouring of the edges of a large complete graph is asymptotically minimized by a ra…
Circle Squaring with Pieces of Small Boundary and Low Borel Complexity
András Máthé, Jonathan A. Noel, Oleg Pikhurko
Tarski's Circle Squaring Problem from 1925 asks whether it is possible to partition a disk in the plane into finitely many pieces and reassemble them via isometries to yield a part…
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…