A family of bijections between \(G\)-parking functions and spanning trees
From MaRDI portal
Publication:1775544
DOI10.1016/j.jcta.2004.08.007zbMath1070.05006arXivmath/0307292MaRDI 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
Parking on supercritical Galton-Watson trees, Trees, parking functions, and standard monomials of skeleton ideals, Parking functions: from combinatorics to probability, Parking functions and tree inversions revisited, Rank-determining sets of metric graphs, Bijections between multiparking functions, Dirichlet configurations, and descending \(R\)-traversals, \(G\)-parking functions, acyclic orientations and spanning trees, From G-parking functions to B-parking functions, Abelian sandpile model and Biggs-Merino polynomial for directed graphs, Cycle Lemma, parking functions and related multigraphs, Integral flow and cycle chip-firing on graphs, Standard monomials of 1-skeleton ideals of graphs and generalized signless Laplacians, Generalized bijective maps between \(G\)-parking functions, spanning trees, and the Tutte polynomial, Chip-firing and energy minimization on M-matrices, Tutte polynomials and \(G\)-parking functions, Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs, Riemann-Roch and Abel-Jacobi theory on a finite graph, Fourientations and the Tutte polynomial, Triangulations of Cayley and Tutte polytopes, Multiparking functions, graph searching, and the Tutte polynomial, Abelian Networks I. Foundations and Examples, Combinatorial interpretations for TG(1, −1), Bigraphical arrangements
Cites Work
