1. Decomposing cubic graphs into isomorphic linear forests with Gal Kronenberg, Shoham Letzter, Alexey Pokrovskiy, 2022, arXiv:2210.11458

  2. Enumerating independent sets in Abelian Cayley graphs with Aditya Potukuchi, 2021, arXiv:2109.06152

  3. Rainbow clique subdivisions and blow-ups, with Tao Jiang, Shoham Letzter and Abhishek Methuku, 2021, arXiv:2108.08814

  4. Size-Ramsey numbers of powers of hypergraph trees and long subdivisions with Shoham Letzter and Alexey Pokrovskiy, 2021, arXiv:2103.01942

  5. Random Turán theorem for hypergraph cycles with Dhruv Mubayi, 2020, arXiv:2007.10320

  6. Linear cycles of consecutive lengths with Tao Jiang and Jie Ma, 2020, arXiv:2006.13206

  7. Full rainbow matchings in equivalence relations with David Munhá Correia, 2020, arXiv:2002.08974

  8. Independence number in triangle-free graphs avoiding a minor with Zdenek Dvorak, 2019, arXiv:1907.12999, accepted at Proceedings of AMS


  1. Rainbow Turán number of clique subdivisions with Tao Jiang and Abhishek Methuku, European Journal of Combinatorics, Volume 110,103675, 2023

  2. New bounds for Ryser's conjecture and related problems with Peter Keevash, Alexey Pokrovskiy and Benny Sudakov, Transactions of AMS, Series B, Volume 9, pages 288-321, 2022

  3. On Turán exponents of bipartite graphs with Tao Jiang and Jie Ma, Combinatorics, Probability and Computing, pages 1-12, 2021

  4. The size Ramsey number of graphs with bounded treewidth with Nina Kamcev, Anita Liebenau and David Wood, SIAM J. Discrete Math. 35.1, pages 281–293, 2021

  5. Distinct degrees in induced subgraphs with Matthew Jenssen, Peter Keevash and Eoin Long, Proceedings of the American Mathematical Society, 148, pages 3835-3846, 2023

  6. Supersaturation of Even Linear Cycles in Linear Hypergraphs with Tao Jiang, Combinatorics, Probability and Computing, 29(5), pages 698-721, 2020

  7. On the number of symbols that forces a transversal with Peter Keevash, Combinatorics, Probability and Computing 29 (2), pages 234-240, 2020

  8. Rainbow factors in hypergraphs with Matthew Coulson, Peter Keevash and Guillem Perarnau, Journal of Combinatorial Theory, Series A, 172, 105184, 2020

  9. Notes on tree- and path-chromatic number with Tony Huynh, Bruce Reed and David Wood, in 2019–20 MATRIX Annals, pages 489–498, Springer, 2021

  10. A Turán theorem for extensions via an Erdos-Ko-Rado theorem for Lagrangians with Sergey Norin and Adam Benne Watts, Combinatorica 39 (5), pages 1149-1171, 2019

  11. Complete graph immersions and minimum degree with Zdenek Dvorak, Journal of Graph Theory 88 (1), pages 211-221, 2017

  12. Rainbow matchings in properly-coloured multigraphs with Peter Keevash, SIAM Journal on Discrete Mathematics 32 (3), pages 1577-1584, 2018

  13. The Turan Number of Extensions with Sergey Norin, Journal of Combinatorial Theory, Series A, 155, pages 476-492, 2018

  14. The extremal function for disconnected minors with Endre Csoka, Irene Lo, Sergey Norin and Hehui Wu, Journal of Combinatorial Theory, Series B, Volume 126, pages 162-174, 2017

  15. The Turan number of Generalized Triangles with Sergey Norin, Journal of Combinatorial Theory Series A, 146, pages 312-343, 2017

  16. Sparse Halves in Dense Triangle-free Graphs with Sergey Norin, Journal of Combinatorial Theory, Series B, pages 1-25, 2015

  17. Sparse Halves in Dense Triangle-free Graphs (extended abstract) with Sergey Norin, Electronic Notes in Discrete Mathematics,Volume 43, pages 271-278, 2014

  18. Interval Edge-Colorings of Graph Products with Petros Petrosyan, Hrant Khachatrian and Hovhannes Tananyan, Proceedings of the CSIT Conference, Yerevan, pages 89-92, 2011