Subgraphs versus Orientations: Infinite families of equidistributions

Oliver Bernardi, Jonathan J. Fang

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that eve…