O'Reilly logo

Enumerative Combinatorics by Sergey Fomin, Richard P. Stanley

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Image

Figure 5-15. A bipartite graph Γ(A).

5.5.10 Proposition. We have

Image

5.5.11 Corollary. We have

Image

Proof. Put ti, = 1 in (5.80) to obtain

Image

Similarly put t1 = 0 and t2 = t3 = ... = 1 (or use (5.79) directly) to obtain (5.81).

5.6 Oriented Trees and the Matrix–Tree Theorem

A famous problem that goes back to Euler asks for what graphs G there is a closed walk ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required