Sharp Dirac's Theorem for DP-Critical Graphs
Combinatorics
2018-07-27 v4
Abstract
Correspondence coloring, or DP-coloring, is a generalization of list coloring introduced recently by Dvo\v{r}\'{a}k and Postle. In this paper we establish a version of Dirac's theorem on the minimum number of edges in critical graphs in the framework of DP-colorings. A corollary of our main result answers a question posed by Kostochka and Stiebitz on classifying list-critical graphs that satisfy Dirac's bound with equality.
Cite
@article{arxiv.1609.09122,
title = {Sharp Dirac's Theorem for DP-Critical Graphs},
author = {Anton Bernshteyn and Alexandr Kostochka},
journal= {arXiv preprint arXiv:1609.09122},
year = {2018}
}
Comments
26 pages, 1 figure