Home /  Workshop /  Schedules /  De-clawing graph theory

De-clawing graph theory

Connections Workshop: Extremal Combinatorics February 06, 2025 - February 07, 2025

February 07, 2025 (03:30 PM PST - 04:30 PM PST)
Speaker(s): Stephanie van Willigenburg (University of British Columbia)
Location: SLMath: Eisenbud Auditorium, Online/Virtual
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

De-clawing graph theory

Abstract

Zoom Link

This talk requires no prior knowledge and will be suitable for a broad audience. We will meet the chromatic symmetric function, dating from 1995, which is a generalization of the chromatic polynomial. We will also hear about a famed problem regarding it, called the Stanley-Stembridge (3+1)-free problem. This has been the focus of much research lately including resolving another problem of Stanley of whether the (3+1)-free problem can be widened. The resulting paper on the latter problem was recently awarded the 2023 MAA David P. Robbins Prize, and we will hear this story too.

Supplements No Notes/Supplements Uploaded
Video/Audio Files

De-clawing graph theory

Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.