1. S. Akbari, O. Etesami, H. Mahini and M. Mahmoody, On rainbow cycles in edge coloured complete graphs, Australas. J. Combin. 37 (2007), 33–42.
2. N. Alon and A. Orlitsky, Repeated communication and Ramsey graphs, IEEE Trans. Inform. Theory 41 (1995), 1276–1289.
3. N. Alon, M. Krivelevich, T. Kaufman and D. Ron, Testing triangle-freeness in general graphs, in Proceedings of the Seventeenth Annual ACM-SIAM SODA 2006, pp. 279–288. Also: SIAM J. Discrete Math. 22 (2008), 786–819.
4. N. Alon and J. H. Spencer, The Probabilistic Method, 4th ed., Wiley, New York, 2016.
5. L. Andersen, Hamilton circuits with many colours in properly edge-coloured complete graphs, Math. Scand. 64 (1989), 5–14.