Name
Abstract | ||
|---|---|---|
Classical problems in hypergraph coloring theory are to estimate the minimum number of edges, m2(r) (respectively, m2∗(r)), in a non-2-colorable r-uniform (respectively, r-uniform and simple) hypergraph. The best currently known bounds are c⋅r∕logr⋅2r⩽m2(r)⩽C⋅r2⋅2randc′⋅r−ε⋅4r⩽m2∗(r)⩽C′⋅r4⋅4r,for any fixed ε>0 and some c, c′, C, C′>0 (where c′ may depend on ε). In this paper we consider the same problems in the context of DP-coloring (also known as correspondence coloring), which is a generalization of list coloring introduced by Dvořák and Postle and related to local conflict coloring studied independently by Fraigniaud, Heinrich, and Kosowski. Let m˜2(r) (respectively, m˜2∗(r)) denote the minimum number of edges in a non-2-DP-colorable r-uniform (respectively, r-uniform and simple) hypergraph. By definition, m˜2(r)⩽m2(r) and m˜2∗(r)⩽m2∗(r). |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ejc.2019.01.011 | European Journal of Combinatorics |
DocType | Volume | ISSN |
Journal | 78 | 0195-6698 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anton Bernshteyn | 1 | 21 | 3.37 |
| Alexandr V. Kostochka | 2 | 682 | 89.87 |