Cite
HARVARD Citation
Aigner‐Horev, E. et al. (2023). Rainbow trees in uniformly edge‐colored graphs. Random structures & algorithms. 62 (2), pp. 287-303. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Aigner‐Horev, E. et al. (2023). Rainbow trees in uniformly edge‐colored graphs. Random structures & algorithms. 62 (2), pp. 287-303. [Online].