Articles:

1. Tiling edge-coloured graphs with few monochromatic bounded-degree graphs.

   J. Corsten and W. Mendonça.

   To appear in Combinatorica.

   
   

2. On the anti-Ramsey threshold for non-balanced graphs.

   P. Araújo, T. Martins, L. Mattos, W. Mendonça, L. Moreira, and G. O. Mota.

   To appear in Electronic Journal of Combinatorics.

   
   

3. Asymmetric Ramsey properties of random graphs involving cliques and cycles.

   A. Liebenau, L. Mattos, W. Mendonça, and J. Skokan.

   Random Structures & Algorithms, 62(4), pp.1035--1055, 2023.

   
   

4. Covering 3-coloured random graphs with monochromatic trees.

   Y. Kohayakawa, G. O. Mota, W. Mendonça, and B. Schülke.

   SIAM Journal on Discrete Mathematics, 35(2), pp.1447-1459, 2021.

   
   

5. The size-Ramsey number of powers of bounded degree trees.

   S. Berger, Y. Kohayakawa, G. S. Maesaka, T. Martins, G. O. Mota, W. Mendonça, and O. Parczyk.

   Journal of the London Mathematical Society, 103(4), pp.1314-1332, 2021.

   
   

Books and Manuscripts:

1. Combinatória.

   F. Botler, M. Collares, T. Martins, W. Mendonça, R. Morris, and G. O. Mota.

   Livro. 33º Colóquio Brasileiro de Matemática. Editora do IMPA, p. 318, 2021.

   Prêmio Elon Lages Lima 2023.

   
   

2. Ramsey theory for sparse graphs.

   W. Mendonça.

   Doctoral thesis. Instituto de Matemática Pura e Aplicada, 2020.

   
   

3. On Ramsey property for random graphs.

   W. Mendonça.

   Master's thesis. Universidade Federal do Ceará, 2016.