论文标题
稀疏简单图的DP色彩有缺陷
Defective DP-colorings of sparse simple graphs
论文作者
论文摘要
DP颜色（也称为对应着色）是Dvočhkand Postle最近开发的列表着色的概括。我们介绍和研究$（i，j）$ - 简单图形的DP颜色有缺陷。令$ g_ {dp}（i，j，n）$为$ n $ -vertex dp-$（i，j）$ - 关键图中的最小边数。在本文中，我们确定每个$ i \ geq3 $和$ j \ j \ geq 2i+1 $ in $ g_ {dp}（i，j，n）$的尖锐绑定。
DP-coloring (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 DP-colorings 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$.
