Correspondence Colouring of Random Graphs
Offered By: Simons Institute via YouTube
Course Description
Overview
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.
Syllabus
Correspondence Colouring of Random Graphs
Taught by
Simons Institute
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer