The stripping process can be slow: part II
classification
🧮 math.CO
keywords
previousresultsstrippinganalysescasecontinuationcriticaldepth
read the original abstract
This paper is a continuation of the previous results on the stripping number of a random uniform hypergraph, and the maximum depth over all non-k-core vertices. The previous results focus on the supercritical case, whereas this work analyses these parameters in the subcritical regime and inside the critical window.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.