Richard Mycroft

View Scopus Profile

Richard Mycroft

Dr.

 https://orcid.org/0000-0002-7900-1801

Accepting PhD Students

PhD projects

Richard Mycroft’s primary research interests lie in the field of extremal graph theory, in which he has worked on a variety of embedding problems. His most recent research develops the theory of matching and packings in uniform hypergraphs, in the presence of various minimum degree conditions. He has also previously considered Hamiltonicity of uniform hypergraphs in a similar manner. Another focus of his research is the problem of embedding trees in directed graphs; the highlight of his work on this topic so far was proving Sumner’s universal tournament conjecture for any sufficiently large tournament. However, this milestone is by no means the end of his interest in this topic; it continues to be an active area of research.

20102019

Research activity per year

Filter
Chapter

Search results

  • 2015

    A geometric theory for hypergraph matching

    Keevash, P. & Mycroft, R., 2015, A geometric theory for hypergraph matching. American Mathematical Society, Vol. 233. 101 p. Chapter 6

    Research output: Chapter in Book/Report/Conference proceeding › Chapter

    16 Citations (Scopus)
    20 Downloads (Pure)
  • 2013

    Polynomial-time perfect matchings in dense hypergraphs

    Keevash, P., Knox, F. & Mycroft, R., 2013, Proceedings of the Annual ACM Symposium on Theory of Computing. p. 311-320 10 p.

    Research output: Chapter in Book/Report/Conference proceeding › Chapter

    3 Citations (Scopus)