JOINT MATHEMATICS COLLOQUIUMUNIVERSITY OF IDAHOWASHINGTON STATE UNIVERSITY |
---|
Abstract |
---|
I will describe a bijection between the
spanning trees and the parking functions of a labeled graph which
relates the number of inversions of a spanning tree with the degree of
its associated parking function. The special case of the complete
graph solves a problem posed by Richard Stanley. This is joint
work with Reed College undergraduates, Qiaoyu Yang and Kuai Yu.
|