2 citations · 3 across the 6 of their papers we have counts for
Showing 2007 · math.COShow all
2 papers · 2 filters
math.CO2007
On the threshold for k-regular subgraphs of random graphs
Pawel Pralat, Jacques Verstraete, Nicholas Wormald
The -core of a graph is the largest subgraph of minimum degree at least . We show that for sufficiently large, the -core of a random graph $\G(n,p)$ asymptotical…
math.CO2007
Expansion properties of a random regular graph after random vertex deletions
Catherine Greenhill, Fred B. Holt, Nicholas Wormald
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p=n^{-a…