Seminars & Colloquia Calendar
List Coloring Graphs
Abigail Raz, Rutgers University
Location: Hill GSL
Date & time: Friday, 17 November 2017 at 1:40PM - 2:40PM
|Abstract: You may be familiar with the problem of properly coloring a graph (no worries if you aren't; this talk will still be accessible). However, what if we change the problem such that the available colors for each vertex are not necessarily the same? (We will, however, mandate that each vertex has the same number of available colors). This is now a problem of list coloring a graph. The list coloring number of a graph is the smallest k, such that for any assignment of a list of k colors to each vertex you can properly color the graph. We will discuss some bounds on the list chromatic number for various families of graphs. Time permitting, we may also take a peek into what happens when we want to color the edges of a graph rather than the vertices.