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

2006/12/15 by Dimitrije Kostić, Dimitrije Kostic, Kostic, Dimitrije
Mathematics · #05C05 (primary) #05C30 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #math.CO #msc:05C05 #msc:05C30

paper · pdf · doi:10.48550/arxiv.math/0612456

13 pages, 3 figures

arxiv created 2006/12/15 · openalex publication_date 2006/12/15 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

There 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.

Related

• A family of bijections between G-parking functions and spanning trees
• (G,m)-multiparking functions
• Generalized Bijective Maps between G-Parking Functions, Spanning\n Trees, and the Tutte Polynomial
• Multiparking Functions, Graph Searching, and the Tutte Polynomial
• Multigraph Hyperplane Arrangements and Parking Functions