A combinatorial reciprocity theorem relates two classes of combinatorial objects via their counting functions. We shall explore the chromatic polynomial, which counts the number of proper n-colourings of a graph, and the significance of its valuation at the negative integers. Furthermore, with assistance of order polynomials and Ehrhart polynomials, a geometric interpretation of this significance will be shown.
Pure Maths Seminar
Tue, 21/04/2020 - 12:00pm
Blackboard link: https://au.bbcollab.com/guest/c4c440f03ca048afab5b890d5d5d574b