Flow polytopes for extensions of bipartite graphs

Abstract

The space of unit flows on a finite acyclic directed graph is a lattice polytope called the flow polytope of the graph. Given a bipartite graph $G$ with minimum degree at least two, we construct two associated acyclic directed graphs: the extension of $G$ and the almost-degree-whiskered graph of $G$. We prove that the normalized volume of the flow polytope for the extension of $G$ is equal to the number of matchings in the almost-degree-whiskered graph of $G$. Further, we refine this result by proving that the Ehrhart $h^{\ast }$-polynomial of the flow polytope for the extension of $G$ is equal to the unsigned matching polynomial of the almost-degree-whiskered graph of $G$.

corrected several typos and clarified parts of one proof