Select Page

Publications

Preprints

  1. An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game. With Abdallah Saffidine and Jeffrey Yang. arXiv:2503.16770
  2. On the Uncommonness of Minimal Rank-2 Systems of Linear Equations. With Dan Altman. arXiv:2404.18908
  3. Universality for Graphs of Bounded Degeneracy. With Peter Allen and Julia Böttcher. arXiv:2309.05468

Publications

  1. On Multicolor Turán Numbers. With József Balogh, Letícia Mattos, and Natasha Morrison. SIAM Journal on Discrete Mathematics, 38(3):2297–2311, 2024. arXiv:2402.05060
  2. On Uncommon Systems of Equations. With Nina Kamčev and Natasha Morrison. Israel Journal of Mathematics, 2024. DOI, arXiv:2106.08986
  3. Asymptotic Enumeration of Graphs by Degree Sequence, and the Degree Sequence of a Random Graph. With Nick Wormald. Journal of the European Mathematical Society, 26:1–40, 2024. Accepted version, Additional PDF (Maple code for Lemma 7.1)
  4. Towards a Characterisation of Sidorenko Systems. With Nina Kamčev and Natasha Morrison. The Quarterly Journal of Mathematics, 74(3):957–974, 2023. arXiv:2107.14413
  5. On the minimum degree of minimal Ramsey graphs for cliques versus cycles. With Anurag Bishnoi, Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta, Thomas Lesgourgues. SIAM Journal on Discrete Mathematics 37(1): 25–50, 2023. arXiv
  6. Asymmetric Ramsey properties of random graphs for cliques and cycles. With Letícia Mattos, Walner Mendonça, Jozef Skokan. Random Structures & Algorithms, 1–21, 2022. DOI, arXiv
  7. Asymptotic enumeration of digraphs and bipartite graphs by degree sequence. With Nick Wormald. Random Structures & Algorithms 62: 259–286, 2022. DOI, arXiv
  8. Asymptotic enumeration of hypergraphs by degree sequence. With Nina Kamčev and Nick Wormald. Advances in Combinatorics (2022), 32357. arXiv
  9. The threshold bias of the clique-factor game. With Rajko Nenadov. Journal of Combinatorial Theory Series B 152 (2022), 221–247. arXiv
  10. The size Ramsey number of graphs with bounded treewidth. With Nina Kamčev, David R. Wood, and Liana Yepremyan. SIAM Journal on Discrete Mathematics 35(1), 281–293, 2021. pdf
  11. Most binary matrices have no small defining set. With Carly Bodkin and Ian M. Wanless. Discrete Mathematics 343(10) (2020), 112035.
  12. An approximate version of Jackson’s conjecture. With Yani Pehova. Combinatorics, Probability and Computing 29(6) (2020), 886–899. pdf
  13. On minimal Ramsey graphs and Ramsey equivalence in multiple colours. With Dennis Clemens and Damian Reding. Combinatorics, Probability and Computing 29(4) (2020), 537–554. arXiv
  14. Caterpillars in Erdős–Hajnal. With Marcin Pilipczuk, Paul Seymour, and Sophie Spirkl. Journal of Combinatorial Theory Series B 146 (2021), 389–416.
  15. Excluding hooks and their complements. With Krzysztof Choromanski, Dvir Falik, Viresh Patel and Marcin Pilipczuk. Electronic Journal of Combinatorics 25(3) (2018), #P3.27. arXiv, EJC
  16. Ramsey equivalence of Kn and Kn+Kn−1. With Thomas F Bloom. Electronic Journal of Combinatorics 25(3) (2018), #P3.4. arXiv, EJC
  17. First order convergence of matroids. With František Kardoš, Dan Král’ and Lukáš Mach. European Journal of Combinatorics 59 (2017), 150–168. arXiv
  18. A non-trivial upper bound on the threshold bias of the Oriented-cycle game. With D. Clemens. Journal of Combinatorial Theory Series B 122 (2017), 21–54. arXiv
  19. On the minimum degree of minimal Ramsey graphs for multiple colours. With Jacob Fox, Andrey Grinshpun, Yury Person and Tibor Szabó. Journal of Combinatorial Theory Series B 120 (2016), 64–82. arXiv
  20. Building spanning trees quickly in Maker–Breaker games. With Dennis Clemens, Asaf Ferber, Roman Glebov and Dan Hefetz. SIAM Journal on Discrete Mathematics 29(3) (2015), 1683–1705. SIDMA (pdf)
  21. On the Concentration of the Domination Number of the Random Graph. With Roman Glebov and Tibor Szabó. SIAM Journal on Discrete Mathematics 29(3) (2015), 1186–1206. SIDMA (pdf)
  22. The Random Graph Intuition for the Tournament Game. With Dennis Clemens and Heidi Gebauer. Combinatorics, Probability and Computing 25 (2016), 76–88. CPC, arXiv
  23. What is Ramsey-equivalent to a clique? With Jacob Fox, Andrey Grinshpun, Yury Person and Tibor Szabó. Journal of Combinatorial Theory Series B 109 (2014), 120–133. arXiv
  24. Fast Strategies In Maker–Breaker Games Played on Random Boards. With Dennis Clemens, Asaf Ferber and Michael Krivelevich. Combinatorics, Probability and Computing 21 (2012), 897–915. CPC, arXiv