Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combinatorial Nullstellensatz and DP-coloring of graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial Nullstellensatz and DP-coloring of graphs |
scientific article |
Statements
Combinatorial Nullstellensatz and DP-coloring of graphs (English)
0 references
8 October 2020
0 references
The authors show how to apply the very well-known tool of the combinatorial Nullstellensatz to a variation of the list-coloring problem for graphs. The paper is very valuable and gives new significant light to the combinatorial Nullstellensatz theorem.
0 references
graph coloring
0 references
list coloring
0 references
Alon-Tarsi number
0 references
combinatorial Nullstellensatz
0 references
DP-coloring
0 references
0 references
0 references
0 references
0.7976526618003845
0 references
0.7674055099487305
0 references
0.7553803324699402
0 references
0.754666268825531
0 references
