\(G\)-parking functions, acyclic orientations and spanning trees

DOI10.1016/j.disc.2010.01.002zbMath1230.05265arXiv0801.1114OpenAlexW2049916150MaRDI QIDQ965998

Prasad Tetali, Brian Benson, Deeparnab Chakrabarty

Publication date: 27 April 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.1114

zbMATH Keywords

spanning treeacyclic orientation\(n\)-cubesandpile model\(G\)-parking function

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (20)

Bigraphical arrangements ⋮ Monomials, binomials and Riemann-Roch ⋮ Parking functions and tree inversions revisited ⋮ Counting k-Naples parking functions through permutations and the k-Naples area statistic ⋮ Efficient enumeration of graph orientations with sources ⋮ A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function ⋮ Fourientations and the Tutte polynomial ⋮ On some quadratic algebras. I \(\frac{1}{2}\): Combinatorics of Dunkl and Gaudin elements, Schubert, Grothendieck, Fuss-Catalan, universal Tutte and reduced polynomials ⋮ The zonotopal algebra of the broken wheel graph and its generalization ⋮ Another proof of Wilmes' conjecture ⋮ Laplacian ideals, arrangements, and resolutions ⋮ The active bijection for graphs ⋮ Partial graph orientations and the Tutte polynomial ⋮ Riemann-Roch theory for graph orientations ⋮ Chip-firing and energy minimization on M-matrices ⋮ Minimal free resolutions of the 𝐺-parking function ideal and the toppling ideal ⋮ Unnamed Item ⋮ On computation of Baker and Norine's rank on complete graphs ⋮ Divisors on graphs, orientations, syzygies, and system reliability ⋮ Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chip-firing games on graphs
• Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings
• Chip-firing and the critical group of a graph
• Chip firing and the Tutte polynomial
• The sand-pile model and Tutte polynomials
• On the sandpile group of dual graphs
• Polynomial ideals for sandpiles and their Gröbner bases
• A family of bijections between \(G\)-parking functions and spanning trees
• The chip firing game on \(n\)-cycles
• The Tutte polynomial as a growth function
• Sinks in acyclic orientations of graphs
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Activity preserving bijections between spanning trees and orientations in graphs
• Branched Polymers
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• Bijective proofs of two broken circuit theorems
• Self-organized critical state of sandpile automaton models
• Trees, parking functions, syzygies, and deformations of monomial ideals
• Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: \(G\)-parking functions, acyclic orientations and spanning trees