@article{781d0956e86544ca82ed706694d69391,
title = "DP-colorings of graphs with high chromatic number",
abstract = "DP-coloring is a generalization of list coloring introduced recently by Dvo{\v r}{\'a}k and Postle (2015). We prove that for every n-vertex graph G whose chromatic number χ(G) is “close” to n, the DP-chromatic number of G equals χ(G). “Close” here means χ(G)≥n−O(n), and we also show that this lower bound is best possible (up to the constant factor in front of n), in contrast to the case of list coloring.",
author = "Anton Bernshteyn and Alexandr Kostochka and Xuding Zhu",
note = "Funding Information: The authors are grateful to the anonymous referees for their valuable comments and suggestions. Research of first author is supported by the Illinois Distinguished Fellowship. Research of second author is supported in part by NSF grant DMS-1600592 and grants 15-01-05867 and 16-01-00499 of the Russian Foundation for Basic Research. Research of third author is supported in part by CNSF grant 11571319. Publisher Copyright: {\textcopyright} 2017 Elsevier Ltd",
year = "2017",
month = oct,
doi = "10.1016/j.ejc.2017.05.007",
language = "English (US)",
volume = "65",
pages = "122--129",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",
}