Correspondence coloring of random graphs

We show that Erdős-Rényi random graphs G(n,p) with constant density p<1 have correspondence chromatic number O(n/√(log n)); 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.