The Stripping Process Can be Slow: Part II

DOI10.1137/15M1054948zbMath1388.05168arXiv1505.02804MaRDI QIDQ5745126

Pu Gao

Publication date: 5 June 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

critical windowrandom hypergraphmaximum depthparallel stripping processstripping number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items

Loose cores and cycles in random hypergraphs

Cites Work

• On the robustness of random \(k\)-cores
• The set of solutions of random XORSAT formulae
• Encores on cores
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Size and connectivity of the \(k\)-core of a random graph
• Two solutions to diluted \(p\)-spin models and XORSAT problems
• Sudden emergence of a giant \(k\)-core in a random graph
• Proof of the Satisfiability Conjecture for Large k
• Almost all graphs with 1.44n edges are 3-colorable
• A simple solution to the k‐core problem
• Inside the clustering window for random linear equations
• The stripping process can be slow: Part I
• A critical point for random graphs with a given degree sequence
• The solution space geometry of random linear equations
• Cores in random hypergraphs and Boolean formulas
• Thek-Core and Branching Processes
• Regular subgraphs of random graphs
• Poisson Cloning Model for Random Graphs
• Unnamed Item
• Unnamed Item