Showing math.COShow all
3 papers · 1 filter
math.CO2026
Greedy Uniformity on Trees: Exact Obstruction and Near-Uniform Spiders
John Fairfax-Ball
Choose a uniformly random ordering of the vertices of a finite tree and run the usual greedy maximal-independent-set algorithm. We compare the resulting law on maximal independent…
math.CO2026
A Fixed-Offset Transition for Random Stackability on Paths
John Fairfax-Ball
We study a support-collapse version of graph pebbling on paths. A configuration is stackable if a sequence of legal pebbling moves can produce a nonzero configuration supported on…
math.CO2026
The stacking number of a tree
John Fairfax-Ball
Csernák and Soukup introduced the stacking number of a graph: the least integer such that every configuration of pebbles can be transformed by pebbling moves into a con…