The geometry and topology of chromatic polynomials

I will talk about a recent paper of Huh, who, building on a wealth of pretty geometry and topology, has given a proof of a conjecture dating back to 1968 regarding the chromatic polynomial (the polynomial that determines how many ways there are of colouring the vertices of a graph with n colours in such a way that no vertices which are joined by an edge have the same colour). I will mainly talk about the way in which a problem that is explicitly a combinatorics problem came to be encoded in algebraic geometry, and give an overview of the geometry and topology that goes into the solution. The talk should be accessible to everyone: no stacks, I promise.