February 09, 2022, 12:15 PM - 1:15 PM
Location:
Mathematics Graduate Student Lounge -- 7th Floor
Rutgers University
Hill Center
Mathematics Department
110 Frelinghuysen Road
Piscataway, NJ 08854
Charles Kenney, Rutgers University
Graph coloring is a central topic in combinatorics with many applications, from maps to chemistry refrigerators. An instance of a list coloring problem inputs a graph G=(V,E) together with sets L(v) of 'colors' for each v in V. One is asked to produce a 'coloring' function S on V with the properties that S(v) is in L(v) for each v in V, and for each w adjacent to v, S(w) is not equal to S(v). In this talk I discuss an interesting family of conditions on the lists L(v) which guarantee the existence of a coloring.
This seminar is being held in person in The Hill Center, Mathematics Graduate Student Lounge - 7th Floor
and online via a simultaneous broadcast on Zoom.
Zoom Link: https://rutgers.zoom.us/j/94499256763
Meeting ID: 944 9925 6763
Password: 104050