17 citations · 26 across the 6 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2017
Core forging and local limit theorems for the k-core of random graphs
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +1
We establish a multivariate local limit theorem for the order and size as well as several other parameters of the k-core of the Erdos-Renyi graph. The proof is based on a novel app…
math.CO2015★ 2 cited
The core in random hypergraphs and local weak convergence
Kathrin Skubch
The degree of a vertex in a hypergraph is defined as the number of edges incident to it. In this paper we study the -core, defined as the maximal induced subhypergraph of minimu…
math.CO2015
How does the core sit inside the mantle?
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +1
The -core, defined as the largest subgraph of minimum degree , of the random graph has been studied extensively. In a landmark paper Pittel, Wormald and Spencer [JCT…