Toppling numbers of complete and random graphs

zbMath1306.05154arXiv1305.1677MaRDI QIDQ5173157

Paweł Prałat, Anthony Bonato, William B. Kinnersley

Publication date: 9 February 2015

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

zbMATH Keywords

chip-firing gameabelian sandpile modeltoppling game

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) 2-person games (91A05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

Game brush number ⋮ Bounds on the game transversal number in hypergraphs ⋮ Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two ⋮ Paired-Domination Game Played in Graphs ⋮ An upper bound on the extremal version of Hajnal's triangle-free game ⋮ Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game

This page was built for publication: Toppling numbers of complete and random graphs