@article{8cd0330aeaf54d769765ef84bea33051,
title = "Defective DP-colorings of sparse simple graphs",
abstract = "DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvo{\v r}{\'a}k and Postle. We introduce and study (i,j)-defective DP-colorings of simple graphs. Let gDP(i,j,n) be the minimum number of edges in an n-vertex DP-(i,j)-critical graph. In this paper we determine sharp bound on gDP(i,j,n) for each i≥3 and j≥2i+1 for infinitely many n.",
keywords = "DP-coloring, Defective coloring, List coloring",
author = "Yifan Jing and Alexandr Kostochka and Fuhong Ma and Jingwei Xu",
note = "A.K. was partially supported by NSF grant DMS1600592, by grants 18-01-00353A and 19-01-00682 of the Russian Foundation for Basic Research and by Arnold O. Beckman Campus Research Board Award RB20003 of the University of Illinois at Urbana-Champaign.F.M. was supported by the National Key R and D Program of China 2020YFA0713100, National Natural Science Foundation of China grant 12125106, and Anhui Initiative in Quantum Information Technologies grant AHY150200.J.X. was partially supported by Arnold O. Beckman Campus Research Board Award RB20003 of the University of Illinois at Urbana-Champaign.",
year = "2022",
month = jan,
doi = "10.1016/j.disc.2021.112637",
language = "English (US)",
volume = "345",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier B.V.",
number = "1",
}