Richard Mycroft

1 - 10 out of 21Page size: 10

Publications

  1. 2018
  2. Published

    Hamilton ℓ-Cycles in Randomly Perturbed Hypergraphs

    Andrew McDowell & Richard Mycroft, 16 Nov 2018, In : Electronic Journal of Combinatorics. 25, 4, 30 p., P4.36.

    Research output: Contribution to journal › Article

  3. Published

    Contagious sets in a degree-proportional bootstrap percolation process

    Frederik Garbe, Andrew McDowell & Richard Mycroft, 29 Oct 2018, In : Random Structures and Algorithms. 53, 4, p. 638-651

    Research output: Contribution to journal › Article

  4. E-pub ahead of print

    Hamilton cycles in hypergraphs below the Dirac threshold

    Frederik Garbe & Richard Mycroft, 9 May 2018, In : Journal of Combinatorial Theory. Series B.

    Research output: Contribution to journal › Article

  5. E-pub ahead of print

    Triangle-tilings in graphs without large independent sets

    Andrew McDowell & Richard Mycroft, 9 May 2018, In : Combinatorics, Probability and Computing. 24 p.

    Research output: Contribution to journal › Article

  6. E-pub ahead of print

    Unavoidable trees in tournaments

    Richard Mycroft, 9 Feb 2018, In : Random Structures and Algorithms. 29 p.

    Research output: Contribution to journal › Article

  7. 2017
  8. Published

    An asymptotic multipartite Kühn-Osthus theorem

    Richard Mycroft, 13 Jul 2017, In : SIAM Journal on Discrete Mathematics. 31, 3, p. 1498-1513 16 p.

    Research output: Contribution to journal › Article

  9. Published

    Tight cycles and regular slices in dense hypergraphs

    Richard Mycroft, Jul 2017, In : Journal of Combinatorial Theory, Series A. 149, p. 30-100 71 p.

    Research output: Contribution to journal › Article

  10. Published

    The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph

    Richard Mycroft, Jun 2017, In : Discrete Mathematics. 340, 6, p. 1172-1179 8 p.

    Research output: Contribution to journal › Article

  11. 2016
  12. E-pub ahead of print

    Hamilton cycles in quasirandom hypergraphs

    Richard Mycroft, 26 Feb 2016, In : Random Structures and Algorithms.

    Research output: Contribution to journal › Article

  13. Published

    The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree

    Frederik Garbe & Richard Mycroft, 16 Feb 2016, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Ollinger, N. & Vollmer, H. (eds.). Dagstuhl, Germany: Schloss Dagstuhl, Vol. 47. p. 1-13 13 p. 38. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 47).

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

Previous 1 2 3 Next