Hardness of peeling with stashes

The analysis of several algorithms and data structures can be framed as a peeling process on a random graph: vertices with degree less than k and their adjacent edges are removed until no vertices ...