AMS Special Session on

Recent Progress in Chromatic Graph Theory

AMS Spring 2023 Eastern Sectional Meeting (online)

April 1st-2nd, 2023

Perspectives and Problems in Chromatic Graph Theory

Starting from the famous four-color conjecture in the mid-19th century, graph coloring problems have been a central theme in graph theory and combinatorics. Birkhoff's introduction in 1912 of the chromatic polynomial for counting colorings built a bridge between algebra and chromatic graph theory. The chromatic polynomial and its generalizations such as Stanley's chromatic symmetric function are an active and essential part of algebraic combinatorics. In extremal combinatorics, the questions arising out of graph colorings and its generalizations such as list colorings (from 1970s), and DP- or Correspondence colorings (from 2015) as well as related covers are a driving force for a variety of widely studied research questions.

In continuation of the theme of the special session last year, this special session proposes to bring together researchers from all parts of combinatorics - algebraic, enumerative, extremal, and structural - that have in recent years made advances in our understanding of problems in graph coloring and its generalizations, and help build connections for cross-fertilization of ideas between these research communities.

To ensure all sections of our research communities have an opportunity to participate in this session, out of the eighteen invited speakers,  nine are junior researchers, including graduate students, and nine are women researchers.


Hemanshu Kaul, Illinois Institute of Technology

Samantha Dahlberg, Illinois Institute of Technology

Invited Speakers

Schedule of Talks

All listed times are Eastern Daylight Time.

Saturday Morning, April 1st

Saturday Afternoon, April 1st

Sunday Morning, April 2nd

Sunday Afternoon, April 2nd

All listed times are Eastern Daylight Time.

Important Links and Deadlines