Correspondence coloring of random graphs
Combinatorics
2023-07-28 v1
Abstract
We show that Erd\H{o}s-R\'enyi random graphs with constant density have correspondence chromatic number ; this matches a prediction from linear Hadwiger's conjecture for correspondence coloring. The proof follows from a simple sufficient condition for correspondence colorability in terms of the numbers of independent sets.
Cite
@article{arxiv.2307.15048,
title = {Correspondence coloring of random graphs},
author = {Zdenek Dvorak and Liana Yepremyan},
journal= {arXiv preprint arXiv:2307.15048},
year = {2023}
}