Avoiding a giant component
Avoiding a giant component
Abstract Let e 1 , e ′ 1 ; e 2 , e ′ 2 ;…; e i , e ′ i ;⋅⋅⋅ be a sequence of ordered pairs of edges chosen uniformly at random from the edge set of the complete graph K n (i.e. we sample with replacement). …