Discrete Applied Math by Samantha Dahlberg:Algebraic Techniques on the DP Color Function

Speaker:

Samantha Dahlberg, postdoctoral scientist, Illinois Institute of Technology

Title: Algebraic Techniques on the DP Color Function

Abstract:  DP-coloring (or correspondence coloring) is a generalization
of list coloring that has been widely studied since its introduction
by Dvořák and Postle in 2015. As the analogue of the chromatic
polynomial of a graph G, P(G,k), the DP color function of G, denoted
by P_{DP}(G, k), counts the minimum number of DP-colorings over all
possible k-fold covers. In this talk we explore the use of algebraic
techniques on the DP color function and the equivalent notation of
S-labellings. We will particularly show how P_{DP}(G, k) grows
exponentially for certain families of graphs. This is joint work with
Hemanshu Kaul and Jeff Mudrock.

 

Discrete Applied Math Seminar

Request Zoom Link