Cite
HARVARD Citation
Han, J. et al. (2021). Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, probability and computing. pp. 570-590. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Han, J. et al. (2021). Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, probability and computing. pp. 570-590. [Online].