Publications

Accepted manuscripts

1. Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph. With N. Wormald, to appear in the Journal of the European Mathematical Society, accepted version. Additional (pdf) file containing Maple code for Lemma 7.1.

2. On uncommon systems of equations. With Nina Kamčev and Natasha Morrison, to appear in the Israel Journal of Mathematics. arXiv.
   
   

Publications

3. Towards a characterisation of Sidorenko systems. With Nina Kamčev and Natasha Morrison, The Quarterly Journal of Mathematics (2023), haad013, https://doi.org/10.1093/qmath/haad013. arXiv.

4. On the minimum degree of minimal Ramsey graphs for cliques versus cycles. With A. Bishnoi, S. Boyadzhiyska, D. Clemens, P. Gupta, T. Lesgourgues, SIAM J. Discrete Math 37(1) (2023), 25-50. arXiv.

5. Asymmetric Ramsey properties of random graphs for cliques and cycles. With Letícia Mattos, Walner Mendonça, Jozef Skokan, Random Structures & Algorithms (2022),  1– 21. https://doi.org/10.1002/rsa.21106. arXiv.

6. Asymptotic enumeration of digraphs and bipartite graphs by degree sequence. With Nick Wormald, Random Structures & Algorithms 62 (2023), 259-286. https://doi.org/10.1002/rsa.21105. arXiv.

7. Asymptotic enumeration of hypergraphs by degree sequence. With Nina Kamčev and Nick Wormald, Advances in Combinatorics (2022), 32357. arXiv. 

8. The threshold bias of the clique-factor game With Rajko Nenadov, Journal of Combinatorial Theory Series B 152 (2022), 221-247 arXiv.

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

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

11. An approximate version of Jackson’s conjecture. With Yani Pehova, Combinatorics, Probability and Computing, 29(6) (2020), 886-899. pdf

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

13. Caterpillars in Erdős-Hajnal. With Marcin Pilipczuk, Paul Seymour and Sophie Spirkl, Journal of Combinatorial Theory Series B 136 (2019), 33-43 pdf

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

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

16. First order convergence of matroids. With František Kardoš, Dan Král' and Lukáš Mach, European Journal of Combinatorics 59 (2017), 150–168. arXiv.

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

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

19. Building spanning trees quickly in Maker-Breaker games. With Dennis Clemens, Asaf Ferber, Roman Glebov and Dan Hefetz, SIAM J. Discrete Math., 29(3) (2015), 1683–1705. SIDMA (pdf) 

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

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

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

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

Extended abstracts

24. Uncommon Systems of Equations. With Nina Kamčev and Natasha Morrison, Extended Abstracts EuroComb (2021), 611-616. 

25. Asymmetric Ramsey properties of random graphs involving cliques and cycles. With Letícia Mattos, Walner Mendonça, Jozef Skokan. Acta Mathematica Universitatis Comenianae, 88(3) (2019), 917-922.

26. An improved bound for orthogeodesic point set embeddings of trees. With Imre Bárány, Kevin Buchin and Michael Hoffmann. In Proc. 31nd European Workshop on Computational Geometry (EuroCG 2015), (2016), 47-50.

27. On the threshold bias in the oriented cycle game. With Dennis Clemens. In The Seventh European Conference on Combinatorics, Graph Theory and Applications: EuroComb 2013, 16 (2014), 359-363.

28. Building spanning trees quickly in Maker-Breaker games. With Dennis Clemens, Asaf Ferber, Roman Glebov and Dan Hefetz. In The Seventh European Conference on Combinatorics, Graph Theory and Applications: EuroComb 2013, 16 (2014), 365-370.