A family of bijections between G-parking functions and spanning trees

Details A family of bijections between G-parking functions and spanning trees A family of bijections between G-parking functions and spanning trees

2003-07-22

arxiv.org/abs/math/0307292v4

Mathematics

Combinatorics

11 pages, 4 figures; a family of bijections containing the two original bijections is presented; submitted to J. Combinatorial

Scientific paper

For a directed graph G on vertices {0,1,...,n}, a G-parking function is an n-tuple (b_1,...,b_n) of non-negative integers such that, for every non-empty subset U of {1,...,n}, there exists a vertex j in U for which there are more than b_j edges going from j to G-U. We construct a family of bijective maps between the set P_G of G-parking functions and the set T_G of spanning trees of G rooted at 0, thus providing a combinatorial proof of |P_G| = |T_G|.

Affiliated with

Also associated with

No associations

Rating

A family of bijections between G-parking functions and spanning trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A family of bijections between G-parking functions and spanning trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A family of bijections between G-parking functions and spanning trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-236330