Cite
HARVARD Citation
Krivelevich, M. et al. (2013). The phase transition in random graphs: A simple proof. Random structures & algorithms. 43 (2), pp. 131-138. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Krivelevich, M. et al. (2013). The phase transition in random graphs: A simple proof. Random structures & algorithms. 43 (2), pp. 131-138. [Online].