Cite
HARVARD Citation
Draganić, N. et al. (2022). The largest hole in sparse random graphs. Random structures & algorithms. 61 (4), pp. 666-677. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Draganić, N. et al. (2022). The largest hole in sparse random graphs. Random structures & algorithms. 61 (4), pp. 666-677. [Online].