Hamilton l-cycles in uniform hypergraphs. - Daniela Kühn; Richard Mycroft; Deryk Osthus (J. Comb. Theory A, 2010)

Loose Hamilton cycles in hypergraphs. - Peter Keevash; Daniela Kühn; Richard Mycroft; Deryk Osthus (Discret. Math., 2011)

A proof of Sumner's universal tournament conjecture for large tournaments. - Deryk Osthus; Daniela Kühn; Richard Mycroft (Electron. Notes Discret. Math., 2011)

An approximate version of Sumnerʼs universal tournament conjecture. - Daniela Kühn; Richard Mycroft; Deryk Osthus (J. Comb. Theory B, 2011)

Polynomial-time perfect matchings in dense hypergraphs. - Peter Keevash; Fiachra Knox; Richard Mycroft (STOC, 2013)

A random version of Sperner's theorem. - József Balogh; Richard Mycroft; Andrew Treglown (J. Comb. Theory A, 2014)

Tight Cycles in Hypergraphs. - Peter Allen 001; Julia Böttcher; Oliver Cooley; Richard Mycroft (Electron. Notes Discret. Math., 2015)

Regular slices for hypergraphs. - Peter Allen 001; Julia Böttcher; Oliver Cooley; Richard Mycroft (Electron. Notes Discret. Math., 2015)

A multipartite Hajnal-Szemerédi theorem. - Peter Keevash; Richard Mycroft (J. Comb. Theory B, 2015)

The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree. - Frederik Garbe; Richard Mycroft (STACS, 2016)

Packing k-partite k-uniform hypergraphs. - Richard Mycroft (J. Comb. Theory A, 2016)

Hamilton cycles in quasirandom hypergraphs. - John Lenz; Dhruv Mubayi; Richard Mycroft (Random Struct. Algorithms, 2016)

The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph. - Oliver Cooley; Richard Mycroft (Discret. Math., 2017)

Tight cycles and regular slices in dense hypergraphs. - Peter Allen 001; Julia Böttcher; Oliver Cooley; Richard Mycroft (J. Comb. Theory A, 2017)

An Asymptotic Multipartite Kühn-Osthus Theorem. - Ryan R. Martin; Richard Mycroft; Jozef Skokan (SIAM J. Discret. Math., 2017)

Hamilton ℓ-Cycles in Randomly Perturbed Hypergraphs. - Andrew McDowell; Richard Mycroft (Electron. J. Comb., 2018)

Triangle-Tilings in Graphs Without Large Independent Sets. - József Balogh; Andrew McDowell; Theodore Molla; Richard Mycroft (Comb. Probab. Comput., 2018)

Hamilton cycles in hypergraphs below the Dirac threshold. - Frederik Garbe; Richard Mycroft (J. Comb. Theory B, 2018)

Contagious sets in a degree-proportional bootstrap percolation process. - Frederik Garbe; Richard Mycroft; Andrew McDowell (Random Struct. Algorithms, 2018)

Unavoidable trees in tournaments. - Richard Mycroft; Tássio Naia (Random Struct. Algorithms, 2018)

Preface. - Allan Lo; Richard Mycroft; Guillem Perarnau; Andrew Treglown (BCC, 2019)

Spanning Trees of Dense Directed Graphs. - Richard Mycroft; Tássio Naia (LAGOS, 2019)

Classification of Maximum Hittings by Large Families. - Candida Bowtell; Richard Mycroft (Graphs Comb., 2020)

Matchings in multipartite hypergraphs. - Candida Bowtell; Richard Mycroft (Comb. Theory, 2025)