Defective DP-colorings of sparse simple graphs
Copyright policy )Defective DP-colorings of sparse simple graphs
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$.
17 pages
- University of Illinois at Urbana Champaign United States
- University of Illinois at Urbana–Champaign United States
- University of Science and Technology of China China (People's Republic of)
- Sobolev Institute of Mathematics Russian Federation
- University of Oxford United Kingdom
list coloring, Coloring of graphs and hypergraphs, DP-coloring, defective coloring, FOS: Mathematics, Mathematics - Combinatorics, Density (toughness, etc.), Combinatorics (math.CO)
list coloring, Coloring of graphs and hypergraphs, DP-coloring, defective coloring, FOS: Mathematics, Mathematics - Combinatorics, Density (toughness, etc.), Combinatorics (math.CO)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!