Publications

Preprints

  1. On uncommon systems of equations. With N. Kamčev and N.Morrison. arXiv.

  2. Asymmetric Ramsey properties of random graphs for cliques and cycles. With L. Mattos, W. Mendonça, J. Skokan. arXiv.

  3. Asymptotic enumeration of hypergraphs by degree sequence. With N. Kamčev and N. Wormald. arXiv.

  4. Asymptotic enumeration of digraphs and bipartite graphs by degree sequence. With N. Wormald. arXiv.

  5. The threshold bias of the clique-factor game With R. Nenadov. arXiv.

  6. Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph. With N. Wormald, arXiv.


Publications

  1. The size Ramsey number of graphs with bounded treewidth. With N. Kamčev, D.R. Wood and L. Yepremyan, SIAM J. Discrete Math 35(1) (2021), 281-293. pdf.

  2. Most binary matrices have no small defining set, With C. Bodkin and I.M. Wanless, Discrete Mathematics, 343(10) (2020), 112035.

  3. An approximate version of Jackson’s conjecture. With Y. Pehova, Combin. Probab. Comput., 29(6) (2020), 886-899. pdf

  4. On minimal Ramsey graphs and Ramsey equivalence in multiple colours. With D. Clemens and D. Reding, Combin. Probab. Comput. 29(4) (2020), 537-554. arXiv.

  5. Caterpillars in Erdős-Hajnal. With M.Pilipczuk, P. Seymour and S. Spirkl, Journal of Combinatorial Theory Series B (2018), https://doi.org/10.1016/j.jctb.2018.09.002. pdf

  6. Excluding hooks and their complements. With K. Choromanski, D. Falik, V. Patel and M. Pilipczuk, Electronic Journal of Combinatorics 25 (3) (2018), #P3.27. arXiv, EJC.

  7. Ramsey equivalence of K_n and K_n+K_{n-1} . With T. F. Bloom, Electronic Journal of Combinatorics 25 (3) (2018), #P3.4. arXiv, EJC.

  8. First order convergence of matroids. With F. Kardoš, D. Král' and L. Mach, European Journal of Combinatorics 59 (2017), 150–168. arXiv.

  9. 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.

    • An extended abstract appeared in The Seventh European Conference on Combinatorics, Graph Theory and Applications, 16 (2013), 359-363.

  10. On the minimum degree of minimal Ramsey graphs for multiple colours. With J. Fox, A. Grinshpun, Y. Person and T. Szabó, Journal of Combinatorial Theory Series B 120 (2016), 64-82. arXiv.

  11. Building spanning trees quickly in Maker-Breaker games. With D. Clemens, A. Ferber, R. Glebov and D. Hefetz, SIAM J. Discrete Math., 29(3) (2015), 1683–1705. SIDMA (pdf)

  12. On the Concentration of the Domination Number of the Random Graph. With R. Glebov and T. Szabó, SIAM J. Discrete Math., 29(3) (2015), 1186–1206. SIDMA (pdf).

  13. The Random Graph Intuition for the Tournament Game. With D. Clemens and H. Gebauer, Combinatorics, Probability and Computing, 25 (2016), 76-88. CPC. arXiv.

  14. What is Ramsey-equivalent to a clique? With J. Fox, A. Grinshpun, Y. Person and T. Szabó, Journal of Combinatorial Theory Series B 109 (2014), 120-133. arXiv.

  15. Fast Strategies In Maker–Breaker Games Played on Random Boards. With D. Clemens, A. Ferber and M. Krivelevich, Combinatorics, Probability and Computing, 21 (2012), 897-915. CPC. arXiv.