... [7] and the survey paper [3] for background information In particular: • T (G; 2, 1) is the number f (G) of spanning forests in G; • T (G; 2, 0) is the number α(G) of acyclic orientations in G In ... α(n)1/n n→∞ n→∞ The proof of the second equality is very similar; it relies again on the formula T (G∗ ; x, y) = T (G; y, x), and the fact that the number of forests and the number of connected ... given in Fig Then the following lemma is clear, since from the knowledge of σ(B) we can update the number of components in the union B ∪ C In the example in Fig we have r(B) = 26, r(C) = and δ(B,...