Extremal number of arborescences
Extremal number of arborescences
In this paper we study the following extremal graph theoretic problem: Given an undirected Eulerian graph $G$, which Eulerian orientation minimizes or maximizes the number of arborescences? We solve the minimization for the complete graph $K_n$, the complete bipartite graph $K_{n,m}$, and for the so-called double graphs, where there are …