Bijections Between Multiparking Functions, Dirichlet Configurations, and Descending R-Traversals

Simple item page
dc.creatorKostic, Dimitrije
dc.date2006-12-15
dc.date.accessioned2026-07-07T07:35:24Z
dc.date.available2026-07-07T07:35:24Z
dc.descriptionThere are several combinatorial objects that are known to be in bijection to the spanning trees of a graph G. These objects include G-parking functions, critical configurations of G, and descending traversals of G. In this paper, we extend the bijections to generalizations of all three objects.
dc.description13 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/math/0612456
dc.identifierhttp://arxiv.org/abs/math/0612456
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/120082
dc.subjectCombinatorics
dc.subject05C30, 05C05 (primary)
dc.titleBijections Between Multiparking Functions, Dirichlet Configurations, and Descending R-Traversals
dc.typetext

Files

Collections

arXiv