Asymptotically good edge correspondence colouring

Abstract

We prove that every simple graph with maximum degree $\Delta$ has an edge correspondence colouring with $\Delta +o(\Delta )$ colours.

References in corpus (4)

• The asymptotic behavior of the correspondence chromatic number
• DP-colorings of graphs with high chromatic number
• Sharp Dirac's Theorem for DP-Critical Graphs
• Complexity of Correspondence Homomorphisms

Cited by in corpus (4)

• Independent transversals in bipartite correspondence-covers
• A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree
• Partial DP-Coloring
• On the Chromatic Polynomial and Counting DP-Colorings