DP-colorings of hypergraphs

DOI10.1016/j.ejc.2019.01.011zbMath1414.05108arXiv1807.08178OpenAlexW2964269433MaRDI QIDQ2422217

Anton Bernshteyn, Alexandr V. Kostochka

Publication date: 18 June 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.08178

zbMATH Keywords

hypergraph coloringcorrespondence coloringDP-coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Partial DP-coloring of graphs ⋮ DP-colorings of uniform hypergraphs and splittings of Boolean hypercube into faces ⋮ A generalization of some results on list coloring and DP-coloring ⋮ Concepts on coloring of cluster hypergraphs with application ⋮ On the chromatic polynomial and counting DP-colorings of graphs ⋮ Combinatorial Nullstellensatz and DP-coloring of graphs ⋮ Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable ⋮ DP-degree colorable hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• On 3-chromatic hypergraphs
• Complexity of choosing subsets from color sets
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• Coloring uniform hypergraphs with few edges
• An application of Lovász' local lemma-A new lower bound for the van der Waerden number
• Improved bounds and algorithms for hypergraph 2-coloring
• On a property of families of sets
• On a combinatorial problem. II
• Inductive construction of perfect ternary constant-weight codes with distance 3