Vishwas Bhargava, Rutgers University

Abstract

We will study a more general notion of Graph Coloring in which the set of permitted colors is different for each vertex, as long as at least {k} colors are listed at each vertex. This leads to the notion of a so-called choice number, which was introduced by Erdős, Rubin, and Taylor. We will prove an interesting upper bound on choice number using Combinatorial Nullstellensatz