Cite
HARVARD Citation
Nagle, B. et al. (2018). An algorithmic hypergraph regularity lemma. Random structures & algorithms. 52 (2), pp. 301-353. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Nagle, B. et al. (2018). An algorithmic hypergraph regularity lemma. Random structures & algorithms. 52 (2), pp. 301-353. [Online].