Skip to main navigation Skip to search Skip to main content
No photo of Deryk Osthus

View Scopus Profile

Deryk Osthus

Prof

 https://orcid.org/0000-0002-3059-4298

Accepting PhD Students

PhD projects

Deryk Osthus’s research interests focus on combinatorics. He has worked on random graphs, randomised algorithms and extremal graph theory. For example, he studied a general version of the perfect matching problem (a perfect matching is a covering of the vertices of a graph by disjoint edges). He is happy to supervise doctoral researchers in the area of combinatorics.

20002025

Research activity per year

Fingerprint

Dive into the research topics where Deryk Osthus is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 1 Similar Profiles
View full fingerprint

Collaborations and top research areas from the last five years

Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Explore network further

  • A characterization of testable hypergraph properties

    Joos, F., Kim, J., Kuhn, D. & Osthus, D., Sept 2025, In: Journal of Combinatorial Theory. Series B. 174, p. 133-189 57 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    File
    46 Downloads (Pure)

  • Hamiltonicity of random subgraphs of the hypercube

    Condon, P., Ferra Gomes De Almeida Girao, A. J., Kuhn, D., Osthus, D. & Espuny Diaz, A., 10 Dec 2024, In: Memoirs of the American Mathematical Society. 304, 1534.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    File
    403 Downloads (Pure)

  • Perfect matchings in random sparsifications of Dirac hypergraphs

    Kang, D. Y., Kelly, T., Kuhn, D., Osthus, D. & Pfenninger, V., 5 Aug 2024, (E-pub ahead of print) In: Combinatorica. 34 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    File
    103 Downloads (Pure)

  • Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree

    Kang, D. Y., Kelly, T., Kühn, D., Methuku, A. & Osthus, D., Dec 2024, In: Proceedings of the London Mathematical Society. 129, 6, 32 p., e70011.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    File
    60 Downloads (Pure)

  • A proof of the Erdos-Faber-Lovasz conjecture

    Kang, D. Y., Kelly, T., Kuhn, D., Methuku, A. & Osthus, D., Sept 2023, In: Annals of Mathematics. 198, 2, p. 537-618 82 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    File
    354 Downloads (Pure)
View all 120 research outputs
View all 10 projects

  • Frontiers of Science award

    Kelly, T. (Recipient), Kang, D. Y. (Recipient), Kuhn, D. (Recipient), Methuku, A. (Recipient) & Osthus, D. (Recipient), 2024

    Prize: Prize (including medals and awards)

  • Fulkerson prize 2021

    Csaba, B. (Recipient), Kuhn, D. (Recipient), Lo, A. (Recipient), Osthus, D. (Recipient) & Treglown, A. (Recipient), 27 Jul 2021

    Prize: Prize (including medals and awards)