The stripping process can be slow: Part I

DOI10.1002/RSA.20760zbMath1401.05205arXiv1501.02695OpenAlexW2805309537MaRDI QIDQ4684328

No author found.

Publication date: 28 September 2018

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-corecritical windowrandom hypergraphsnumber of iterationsstripping process

Mathematics Subject Classification ID

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

Related Items (4)

The satisfiability threshold for random linear equations ⋮ The Stripping Process Can be Slow: Part II ⋮ Rigid Colorings of Hypergraphs and Contiguity ⋮ Loose cores and cycles in random hypergraphs

This page was built for publication: The stripping process can be slow: Part I