Richard Mycroft

According to our database1, Richard Mycroft authored at least 23 papers between 2010 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Classification of Maximum Hittings by Large Families.
Graphs Comb., 2020

2019
Spanning Trees of Dense Directed Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Preface.
Proceedings of the Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29, 2019

2018
Unavoidable trees in tournaments.
Random Struct. Algorithms, 2018

Contagious sets in a degree-proportional bootstrap percolation process.
Random Struct. Algorithms, 2018

Hamilton cycles in hypergraphs below the Dirac threshold.
J. Comb. Theory B, 2018

Triangle-Tilings in Graphs Without Large Independent Sets.
Comb. Probab. Comput., 2018

Hamilton ℓ-Cycles in Randomly Perturbed Hypergraphs.
Electron. J. Comb., 2018

2017
An Asymptotic Multipartite Kühn-Osthus Theorem.
SIAM J. Discret. Math., 2017

Tight cycles and regular slices in dense hypergraphs.
J. Comb. Theory A, 2017

The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph.
Discret. Math., 2017

2016
Hamilton cycles in quasirandom hypergraphs.
Random Struct. Algorithms, 2016

Packing k-partite k-uniform hypergraphs.
J. Comb. Theory A, 2016

The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015
A multipartite Hajnal-Szemerédi theorem.
J. Comb. Theory B, 2015

Regular slices for hypergraphs.
Electron. Notes Discret. Math., 2015

Tight Cycles in Hypergraphs.
Electron. Notes Discret. Math., 2015

2014
A random version of Sperner's theorem.
J. Comb. Theory A, 2014

2013
Polynomial-time perfect matchings in dense hypergraphs.
Proceedings of the Symposium on Theory of Computing Conference, 2013

2011
An approximate version of Sumnerʼs universal tournament conjecture.
J. Comb. Theory B, 2011

A proof of Sumner's universal tournament conjecture for large tournaments.
Electron. Notes Discret. Math., 2011

Loose Hamilton cycles in hypergraphs.
Discret. Math., 2011

2010
Hamilton <i>l</i>-cycles in uniform hypergraphs.
J. Comb. Theory A, 2010


  Loading...