Recent publications
Article
Bowtell, C & Mycroft, R 2019, 'Classification of Maximum Hittings by Large Families', Graphs and Combinatorics, vol. 36, pp. 27-39. https://doi.org/10.1007/s00373-019-02115-1
Garbe, F, McDowell, A & Mycroft, R 2018, 'Contagious sets in a degree-proportional bootstrap percolation process', Random Structures and Algorithms, vol. 53, no. 4, pp. 638-651. https://doi.org/10.1002/rsa.20818
Garbe, F & Mycroft, R 2018, 'Hamilton cycles in hypergraphs below the Dirac threshold', Journal of Combinatorial Theory. Series B. https://doi.org/10.1016/j.jctb.2018.04.010
McDowell, A & Mycroft, R 2018, 'Hamilton ℓ-Cycles in Randomly Perturbed Hypergraphs', Electronic Journal of Combinatorics, vol. 25, no. 4, P4.36. <http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p36>
Balogh, J, McDowell, A, Molla, T & Mycroft, R 2018, 'Triangle-tilings in graphs without large independent sets', Combinatorics, Probability and Computing. https://doi.org/10.1017/S0963548318000196
Mycroft, R & Naia Dos Santos, T 2018, 'Unavoidable trees in tournaments', Random Structures and Algorithms. https://doi.org/10.1002/rsa.20765
Martin, R, Mycroft, R & Skokan, J 2017, 'An asymptotic multipartite Kühn-Osthus theorem', SIAM Journal on Discrete Mathematics, vol. 31, no. 3, pp. 1498-1513. https://doi.org/10.1137/16M1070621
Cooley, O & Mycroft, R 2017, 'The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph', Discrete Mathematics, vol. 340, no. 6, pp. 1172-1179. https://doi.org/10.1016/j.disc.2016.12.015
Allen, P, Böttcher, J, Cooley, O & Mycroft, R 2017, 'Tight cycles and regular slices in dense hypergraphs', Journal of Combinatorial Theory, Series A, vol. 149, pp. 30-100. https://doi.org/10.1016/j.jcta.2017.01.003
Lenz, J, Mubayi, D & Mycroft, R 2016, 'Hamilton cycles in quasirandom hypergraphs', Random Structures and Algorithms. https://doi.org/10.1002/rsa.20638
Mycroft, R 2016, 'Packing k-partite k-uniform hypergraphs', Journal of Combinatorial Theory, Series A, vol. 138, pp. 60-132. https://doi.org/10.1016/j.jcta.2015.09.007
Keevash, P & Mycroft, R 2015, 'A Multipartite Hajnal-Szemerédi Theorem', Journal of Combinatorial Theory. Series B, vol. 114, pp. 187-236. https://doi.org/10.1016/j.jctb.2015.04.003
Keevash, P, Knox, F & Mycroft, R 2015, 'Polynomial-time perfect matchings in dense hypergraphs', Advances in Mathematics, vol. 269, pp. 265-334. https://doi.org/10.1016/j.aim.2014.10.009
Chapter
Keevash, P & Mycroft, R 2015, A geometric theory for hypergraph matching. in A geometric theory for hypergraph matching. vol. 233, Chapter 6, American Mathematical Society. https://doi.org/10.1090/memo/1098
Conference contribution
Garbe, F & Mycroft, R 2016, The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree. in N Ollinger & H Vollmer (eds), 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). vol. 47, 38, Leibniz International Proceedings in Informatics (LIPIcs), vol. 47, Schloss Dagstuhl, Dagstuhl, Germany, pp. 1-13. https://doi.org/10.4230/LIPIcs.STACS.2016.38
View all publications in research portal