A family of bijections between \(G\)-parking functions and spanning trees
From MaRDI portal
Publication:1775544
DOI10.1016/J.JCTA.2004.08.007zbMath1070.05006arXivmath/0307292OpenAlexW2050285673MaRDI QIDQ1775544
Pavlo Pylyavskyy, Denis Chebikin
Publication date: 4 May 2005
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0307292
Related Items (23)
Combinatorial interpretations for TG(1, −1) ⋮ Bigraphical arrangements ⋮ Parking functions and tree inversions revisited ⋮ Riemann-Roch and Abel-Jacobi theory on a finite graph ⋮ Generalized bijective maps between \(G\)-parking functions, spanning trees, and the Tutte polynomial ⋮ From G-parking functions to B-parking functions ⋮ Fourientations and the Tutte polynomial ⋮ Abelian sandpile model and Biggs-Merino polynomial for directed graphs ⋮ Parking on supercritical Galton-Watson trees ⋮ Trees, parking functions, and standard monomials of skeleton ideals ⋮ Parking functions: from combinatorics to probability ⋮ Triangulations of Cayley and Tutte polytopes ⋮ Cycle Lemma, parking functions and related multigraphs ⋮ Bijections between multiparking functions, Dirichlet configurations, and descending \(R\)-traversals ⋮ Integral flow and cycle chip-firing on graphs ⋮ Multiparking functions, graph searching, and the Tutte polynomial ⋮ \(G\)-parking functions, acyclic orientations and spanning trees ⋮ Chip-firing and energy minimization on M-matrices ⋮ Rank-determining sets of metric graphs ⋮ Tutte polynomials and \(G\)-parking functions ⋮ Abelian Networks I. Foundations and Examples ⋮ Standard monomials of 1-skeleton ideals of graphs and generalized signless Laplacians ⋮ Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs
Cites Work
This page was built for publication: A family of bijections between \(G\)-parking functions and spanning trees