A family of bijections between G-parking functions and spanning trees
| dc.creator | Chebikin, Denis | |
| dc.creator | Pylyavskyy, Pavlo | |
| dc.date | 2003-07-22 | |
| dc.date | 2004-06-30 | |
| dc.date.accessioned | 2026-07-07T04:59:49Z | |
| dc.date.available | 2026-07-07T04:59:49Z | |
| dc.description | 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|. | |
| dc.description | 11 pages, 4 figures; a family of bijections containing the two original bijections is presented; submitted to J. Combinatorial Theory, Series A | |
| dc.identifier | https://arxiv.org/abs/math/0307292 | |
| dc.identifier | http://arxiv.org/abs/math/0307292 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/68142 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A99; 05C05 | |
| dc.title | A family of bijections between G-parking functions and spanning trees | |
| dc.type | text |