DP-coloring is a generalization of list coloring introduced recently by Dvořák and Postle (2015). We prove that for every -vertex graph whose chromatic number is “close” to , the DP-chromatic number of equals . “Close” here means , and we also show that this lower bound is best possible (up to the constant factor in front of ), in contrast to the case of list coloring.