Correspondence Colouring of Random Graphs

Explore the concept of correspondence colouring in random graphs through this one-hour lecture by Liana Yepremyan from Emory University. Delve into structural results for Erdős-Renyi random graphs with constant density, examining their correspondence chromatic number. Learn about a sufficient condition for correspondence colourability based on the numbers of independent sets. Discover how the presented findings align with predictions from linear Hadwiger's conjecture for correspondence colouring. Consider the conjecture that the true order may be O(n/logn), as suggested by random correspondence assignment. Gain insights into this collaborative research conducted with Zdenek Dvorak, advancing understanding of graph theory and coloring problems.

Correspondence Colouring of Random Graphs