LGRT 219
A flow polytope of a graph is the set of flows on the edges of the graph with prescribed net flows on vertices. Flow polytopes of graphs are a rich family of polytopes of interest in probability, optimization, representation theory, and algebraic combinatorics. Special cases of these polytopes have remarkable formulas for their volume related to the famous Selberg integral. I will give an overview of recent work on these polytopes including formulas that relate their volume to the number of lattice points, and the geometry of their triangulations. This talk will be accessible to graduate students.