Tree bijections

Igor Pak
University of California, Los Angeles (UCLA)

Cayley formula on the number of spanning trees in a complete graph is one of the most celebrated results in combinatorics. The number and variety of bijective proofs of this formula is truly astonishing, many of them having important generalizations and interesting corollaries. I will survey a number of such tree bijections, emphasizing probabilistic connections and applications. In this, as in the other lectures, no previous familiarity with the subject is assumed.

Presentation (PDF File)

Back to Combinatorics Tutorials