The chip-firing game

DOI10.1016/J.DISC.2004.07.033zbMATH Open1139.91314OpenAlexW2020915184MaRDI QIDQ2575794FDOQ2575794

Criel Merino

Publication date: 6 December 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.033

zbMATH Keywords

Tutte polynomialMatroidChip-firing game

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial aspects of matroids and geometric lattices (05B35) Games involving graphs (91A43)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Contribution to the Theory of Chromatic Polynomials
• 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
• Combinatorics and commutative algebra.
• Self-organized criticality
• Self-organized critical state of sandpile automaton models
• Algebraic aspects of Abelian sandpile models
• Chip-firing games on graphs
• Introduction to Greedoids
• Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes
• Balancing vectors in the max norm
• The probabilistic abacus
• The Tutte polynomial as a growth function
• A chip-firing game and Dirichlet eigenvalues
• Disks, Balls, and Walls: Analysis of a Combinatorial Game
• The lattice of integral flows and the lattice of integral cuts on a finite graph
• Chip-firing games on directed graphs
• The Potts model and the Tutte polynomial.
• A finite group attached to the laplacian of a graph
• Chip-Firing Games on Mutating Graphs
• Greedoids
• Polynomial Bound for a Chip Firing Game on Graphs
• No Polynomial Bound for the Chip Firing Game on Directed Graphs
• Parallel chip firing games on graphs
• Balancing games
• Vector balancing games with aging

Cited In (39)

• The structure of a linear chip firing game and related models
• Spanning trees and recurrent configurations of a graph
• Digraphs with at most one trivial critical ideal
• Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
• Computing graph gonality is hard
• Graphs with few trivial characteristic ideals
• Multicommodity Allocation for Dynamic Demands Using PageRank Vectors
• Chip-firing games on directed graphs
• Some statistics about tropical sandpile model
• Game brush number
• Brushing with additional cleaning restrictions
• Anisotropic higher rank \(\mathbb{Z}_N\) topological phases on graphs
• The structure of sandpile groups of outerplanar graphs
• The chip-firing game and the sandpile model
• A chip-firing game and Dirichlet eigenvalues
• Title not available (Why is that?)
• Codeterminantal graphs
• Properties of chip-firing games on complete graphs
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Graphs with few trivial critical ideals
• Distance ideals of graphs
• Critical ideals of signed graphs with twin vertices
• Token graphs
• The sandpile model on \(K_{m,n}\) and the rank of its configurations
• Graphs with real algebraic co-rank at most two
• Graphs whose critical groups have larger rank
• On graphs with 2 trivial distance ideals
• A maximizing characteristic for critical configurations of chip-firing games on digraphs
• On the proportion of metric matroids whose Jacobians have nontrivial \(p\)-torsion
• A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case
• A family of matrix-tree multijections
• Critical ideals, minimum rank and zero forcing number
• Small clique number graphs with three trivial critical ideals
• Chip-firing, antimatroids, and polyhedra
• Counting spanning trees in self-similar networks by evaluating determinants
• Title not available (Why is that?)
• Algorithmic aspects of a chip-firing game
• Graphs with two trivial critical ideals
• Treewidth is a lower bound on graph gonality

   Recommendations

• The chip-firing game and the sandpile model 👍 👎
• Chip-firing games on graphs 👍 👎
• Chip firing and the Tutte polynomial 👍 👎
• Title not available (Why is that?) 👍 👎
• Chip Firing and Algebraic Curves 👍 👎

This page was built for publication: The chip-firing game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575794)