DP-degree colorable hypergraphs (Q2333798)

\textit{Z. Dvořák} and \textit{L. Postle} [J. Comb. Theory, Ser. B 129, 38--54 (2018; Zbl 1379.05034)] introduced under the name correspondence coloring a coloring concept to study list coloring problems of graphs. Later, \textit{A. Yu. Bernshteyn} et al. [Sib. Math. J. 58, No. 1, 28--36 (2017; Zbl 1366.05038); translation from Sib. Mat. Zh. 58, No. 1, 36--47 (2017)] introduced the now established name DP-coloring for this concept. DP-coloring turned out to be a very useful method to study graph coloring problems. This paper generalizes the concept of DP-coloring to hypergraphs, and it proves a Brooks-type result for the DP-chromatic number of a hypergraph by characterizing the DP-degree colorable hypergraphs, and the corresponding ``bad'' covers.