Showing 2025Show all
2 papers · 1 filter
math.CO2025
On the chromatic number of random triangle-free graphs
Clayton Mizgerd, Will Perkins, Yuzhou Wang
We study the chromatic number of typical triangle-free graphs with edges and establish the width of the scaling window for the transitions…
math.CO2025
The random graph process is globally synchronizing
Vishesh Jain, Clayton Mizgerd, Mehtaab Sawhney
The homogeneous Kuramoto model on a graph is a network of identical oscillators, one at each vertex, where every oscillator is coupled bidirectionally (with unit…