Title: Colouring graphs, symmetric functions, and open problems
Abstract: The chromatic number of a graph is the fewest number of colours needed to properly colour the vertices so that no two adjacent vertices have the same colour. In this talk we will discuss the chromatic symmetric function, an isomorphism-invariant generalization of chromatic numbers that plays an important role in algebraic combinatorics. In addition to looking at what’s known, we will discuss open problems involving the chromatic symmetric function and perform computer experimentation with SageMath.
Coffee available 5pm in Hamilton Hall – 216 (Lounge)