70 citations · 467 across the 59 of their papers we have counts for
Showing 2007 · math.COShow all
2 papers · 2 filters
math.CO2007
Dismantling sparse random graphs
Svante Janson, Andrew Thomason
We consider the number of vertices that must be removed from a graph G in order that the remaining subgraph has no component with more than k vertices. Our principal observation is…
math.CO2007
A new approach to the giant component problem
Svante Janson, Malwina Luczak
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. We let n tend to infinity. Then, under some regularity conditions on the degree…