2 papers
math.PR2025
The critical Karp--Sipser core of random graphs
Thomas Budzinski, Alice Contat, Nicolas Curien
We study the Karp--Sipser core of a random graph made of a configuration model with vertices of degree and . This core is obtained by recursively removing the leaves as we…
math.PR2024
The critical Karp--Sipser core of ErdÅs--Rényi random graphs
Thomas Budzinski, Alice Contat
The Karp--Sipser algorithm consists in removing recursively the leaves as well their unique neighbours and all isolated vertices of a given graph. The remaining graph obtained when…