A new approach to the giant component problem
A new approach to the giant component problem
Abstract We study the largest component of a random (multi)graph on n vertices with a given degree sequence. We let n → ∞ . Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the degree sequence that imply that with high probability …