School of Mathematics
,
University of Birmingham
Richard Mycroft
Preprints and publications
Preprints:
Hamilton $\ell$-cycles in randomly-perturbed hypergraphs
(with Andrew McDowell), preprint.
Contagious sets in a degree-proportional bootstrap percolation process
(with
Frederik Garbe
and Andrew McDowell), preprint.
Hamilton cycles in hypergraphs below the Dirac threshold
(with
Frederik Garbe
), preprint.
Accepted for publication:
Triangle-tilings in graphs without large independent sets
(with
Jozsef Balogh
, Andrew McDowell and
Theodore Molla
),
Combinatorics, Probability and Computing
, to appear.
Unavoidable trees in tournaments
(with
Tássio Naia
),
Random Structures & Algorithms
, to appear.
Papers:
An asymptotic multipartite Kühn-Osthus theorem
(with
Ryan Martin
and
Jozef Skokan
),
SIAM Journal of Discrete Mathematics
,
31
(2017), 1498-1513.
The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
(with
Oliver Cooley
),
Discrete Mathematics
,
340
(2017), 1172-1179.
Tight cycles and regular slices in dense hypergraphs
(with
Peter Allen
,
Julia Böttcher
and
Oliver Cooley
),
Journal of Combinatorial Theory, Series A
,
149
(2017), 30-100.
Hamilton cycles in quasirandom hypergraphs
(with
John Lenz
and
Dhruv Mubayi
),
Random Structures & Algorithms
,
49
(2016), 363-378.
The complexity of the Hamilton cycle problem in hypergraphs of high minimum codegree
(with
Frederik Garbe
),
Proceedings of the 33rd STACS
(2016), 38:1-13.
Packing k-partite k-uniform hypergraphs
,
Journal of Combinatorial Theory, Series A
,
138
(2016), 60-132.
A multipartite Hajnal-Szemerédi theorem
(with
Peter Keevash
),
Journal of Combinatorial Theory, Series B
,
114
(2015), 187-236.
Polynomial-time perfect matchings in dense hypergraphs
(with
Peter Keevash
and Fiachra Knox),
Advances in Mathematics
,
269
(2015), 265-334.
A geometric theory for hypergraph matching
(with
Peter Keevash
),
Memoirs of the American Mathematical Society
,
233
(2015), monograph 1098 (101 pages).
A random version of Sperner's theorem
(with
Jozsef Balogh
and
Andrew Treglown
),
Journal of Combinatorial Theory, Series A
,
128
(2014), 104-110.
Polynomial-time perfect matchings in dense hypergraphs
(with
Peter Keevash
and Fiachra Knox),
Proceedings of the 45th STOC
(2013), 311-320.
An approximate version of Sumner's universal tournament conjecture
(with
Daniela Kühn
and
Deryk Osthus
),
Journal of Combinatorial Theory, Series B
,
101
(2011), 415-447.
A proof of Sumner's universal tournament conjecture for large tournaments
(with
Daniela Kühn
and
Deryk Osthus
),
Proceedings of the London Mathematical Society
,
102
(2011), 731-766.
Loose Hamilton cycles in hypergraphs
(with
Peter Keevash
,
Daniela Kühn
and
Deryk Osthus
),
Discrete Mathematics
,
311
(2011), 544-559.
Hamilton l-cycles in uniform hypergraphs
(with
Daniela Kühn
and
Deryk Osthus
),
Journal of Combinatorial Theory, Series A
,
117
(2010), 910-927.
Conference abstracts:
Tight Cycles in Hypergraphs
(with
Peter Allen
,
Julia Bottcher
and Oliver Cooley),
Electronic Notes in Discrete Mathematics
,
49
(2015), 675-682.
Regular Slices for Hypergraphs
(with
Peter Allen
,
Julia Bottcher
and Oliver Cooley),
Electronic Notes in Discrete Mathematics
,
49
(2015), 691-698.
A multipartite Hajnal-Szemerédi theorem
(with
Peter Keevash
),
The Seventh European Conference on Combinatorics, Graph Theory and Applications
, CRM Series Vol. 16 (2013), 141-146.
Packing k-partite k-uniform hypergraphs
,
Electronic Notes in Discrete Mathematics
,
38
(2011), 663-668.
A proof of Sumner's universal tournament conjecture for large tournaments
(with
Daniela Kühn
and
Deryk Osthus
),
Electronic Notes in Discrete Mathematics
,
38
(2011), 687-692.