Defective DPcolorings of sparse simple graphs
Abstract
DPcoloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study $(i,j)$defective DPcolorings of simple graphs. Let $g_{DP}(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 $g_{DP}(i,j,n)$ for each $i\geq3$ and $j\geq 2i+1$ for infinitely many $n$.
 Publication:

arXiv eprints
 Pub Date:
 June 2020
 arXiv:
 arXiv:2006.10244
 Bibcode:
 2020arXiv200610244J
 Keywords:

 Mathematics  Combinatorics
 EPrint:
 17 pages