Pages that link to "Item:Q2323097"

The following pages link to The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations (Q2323097):

Displaying 8 items.

• A bijective enumeration of tiered trees (Q776308) (← links)
• Counting spanning trees in almost complete multipartite graphs (Q2082527) (← links)
• The sandpile model on the complete split graph, Motzkin words, and tiered parking functions (Q2229180) (← links)
• Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees (Q2318776) (← links)
• Biconed graphs, weighted forests, and \(h\)-vectors of matroid complexes (Q2665976) (← links)
• Combinatorial aspects of sandpile models on wheel and Fan graphs (Q2700973) (← links)
• An Ising model having permutation spin motivated by a permutation complexity measure (Q6095687) (← links)
• The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group (Q6097068) (← links)