Seminar Details
List Lengths and Color Degrees
- Start Date: February 9, 2022
- Event Start Time: 12:15 PM
- Event End Time: 1:15 PM
- Seminar Series: Graduate Combinatorics Seminar
- Presenter(s): Charles Kenney - Rutgers University
- Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
- Event Additional Info: <p><strong>This seminar is being held in person in The Hill Center, Mathematics Graduate Student Lounge - 7th Floor<br /> and online via a simultaneous broadcast on Zoom. </strong><br /> Zoom Link: <a href="https://rutgers.zoom.us/j/94499256763?pwd=QUFuQ3FSbW1nKzNiNGlTVjA2NnJxdz09">https://rutgers.zoom.us/j/94499256763</a></p> <p><br /> Meeting ID: 944 9925 6763</p> <p>Password: 104050</p>
- Presentation Type: Stand Alone Presentation
- Abstract:
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.