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 $\hat{I}˜\left(n^{3/2}(\log n{)}^{1/2}\right)$ edges and establish the width of the scaling window for the transitions…