Cite
HARVARD Citation
Fox, J. et al. (2021). Sets without k‐term progressions can have many shorter progressions. Random structures & algorithms. 58 (3), pp. 383-389. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Fox, J. et al. (2021). Sets without k‐term progressions can have many shorter progressions. Random structures & algorithms. 58 (3), pp. 383-389. [Online].