Preprints

1. Monochromatic partitions in 2-edge-coloured bipartite graphs, with Camila Fernández and Maya Stein.

2. Spanning trees in pseudorandom graphs via sorting networks, with Joseph Hyde, Natasha Morrison, and Alp Müyesser. 

3. Ramsey numbers of bounded degree trees versus general graphs, with Richard Montgomery and Jun Yan. 

4. Counting spanning subgraphs in dense hypergraphs, with Richard Montgomery. 

5. Spanning trees in the square of pseudorandom graphs. 

6. Ramsey numbers of cycles in random graphs, with Pedro Araújo and Nicolás Sanhueza-Matamala.

Published

1. Dirac-type conditions for spanning bounded-degree hypertrees, with Nicolás Sanhueza-Matamala and Maya Stein, Journal of Combinatorial Theory Series B 2024.

2. Spanning subdivisions in Dirac graphs. Combinatorics, Probability and Computing 2024. 

3. Ramsey numbers with prescribed rate of growth, with Simón Piga and Nicolás Sanhueza-Matamala, Electronic Journal of Combinatorics 2023.

4. Towards a hypergraph version of the Pósa-Seymour conjecture, with Nicolás Sanhueza-Matamala and Maya Stein,  Advances in Combinatorics 2023.

5. Ramsey goodness of trees in random graphs, with Pedro Araújo and Luiz Moreira, Random Structures & Algorithms 2023.

6. Quasi-random words and limits of word sequences, with Hiêp Hàn and Marcos Kiwi, European Journal of Combinatorics 2021.

7. Universal arrays, with Daniel A. Quiroz and Nicolás Sanhueza-Matamala, Discrete Mathematics 2021.

8. On the Erdős -Sós conjecture for trees with bounded degree, with Guido Besomi and Maya Stein,  Combinatorics, Probability and Computing 2021.

9. Maximum and minimum degree conditions for embedding trees, with Guido Besomi and Maya Stein,  SIAM Journal on Discrete Mathematics 2020.

10. Degree conditions for embedding trees, with Guido Besomi and Maya Stein,  SIAM Journal on Discrete Mathematics 2019.

11. Rates of convergence for inexact Krasnosel'skii-Mann iterations in Banach spaces, with Mario Bravo and Roberto Cominetti, Mathematical Programming Series A 2019.