DP-colorings of hypergraphs (Q2422217)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	DP-colorings of hypergraphs	scientific article

Statements

scholarly article

0 references

DP-colorings of hypergraphs (English)

0 references

Anton Bernshteyn

0 references

Alexandr V. Kostochka

0 references

European Journal of Combinatorics

0 references

publication date

18 June 2019

0 references

full work available at URL

https://arxiv.org/abs/1807.08178

0 references

zbMATH Keywords

hypergraph coloring

0 references

DP-coloring

0 references

correspondence coloring

0 references

MaRDI profile type

MaRDI publication profile

0 references

On 3-chromatic hypergraphs

0 references

Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8

0 references

0 references

On a combinatorial problem. II

0 references

On a property of families of sets

0 references

0 references

0 references

Coloring uniform hypergraphs with few edges

0 references

Complexity of choosing subsets from color sets

0 references

Inductive construction of perfect ternary constant-weight codes with distance 3

0 references

On the minimum size of 4-uniform hypergraphs without property \(B\)

0 references

Improved bounds and algorithms for hypergraph 2-coloring

0 references

An application of Lovász' local lemma-A new lower bound for the van der Waerden number

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejc.2019.01.011

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2422217

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2422217&oldid=37856900"