{"paper":{"title":"DP-Degree Colorable Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thomas Schweser","submitted_at":"2018-08-06T08:30:28Z","abstract_excerpt":"In order to solve a question on list coloring of planar graphs, Dvo\\v{r}\\'{a}k and Postle introduced the concept of so called DP-coloring, thereby extending the concept of list-coloring. DP-coloring was anaylized in detail by Bernshteyn, Kostochka, and Pron for graphs and multigraphs; they characterized DP-degree colorable multigraphs and deduced a Brooks' type result from this. The characterization of the corresponding 'bad' covers was later given by Kim and Ozeki. In this paper, the concept of DP-colorings is extended to hypergraphs having multiple (hyper-)edges. We characterize the DP-degre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01767","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}