World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
4484
World Ranking
10410
National Ranking
657

Mathematics

D-Index
38
Citations
4491
World Ranking
2399
National Ranking
158

Overview

Deryk Osthus is affiliated with the University of Birmingham in the United Kingdom. Their research spans the fields of Mathematics and Computer Science, with a focus on discrete mathematics, combinatorics, and computational theory. Their subfields of study also include electrical and electronic engineering, geometry and topology, and mathematical physics.

The scientist's work covers various topics related to graph theory and combinatorics. These main topics include:

  • Limits and Structures in Graph Theory
  • Advanced Graph Theory Research
  • Graph theory and CDMA systems
  • Graph Labeling and Dimension Problems
  • Graph theory and applications
  • Finite Group Theory Research
  • Complexity and Algorithms in Graphs

Osthus has published extensively in multiple venues. Notable frequent publication venues include:

  • arXiv (Cornell University)
  • COMBINATORICA
  • Random Structures and Algorithms
  • Journal of Combinatorial Theory Series B
  • Memoirs of the American Mathematical Society

Recent papers by the researcher illustrate ongoing involvement in combinatorial design theory and graph theory. These publications include:

  • "On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems", 2020, COMBINATORICA
  • "Minimalist designs", 2020, Random Structures and Algorithms
  • "The Existence of Designs via Iterative Absorption: Hypergraph -designs for Arbitrary ", 2023, Memoirs of the American Mathematical Society
  • "Rainbow structures in locally bounded colorings of graphs", 2020, Random Structures and Algorithms
  • "Euler Tours in Hypergraphs", 2020, COMBINATORICA

Their research frequently involves collaboration with other scholars. Prominent co-authors include:

  • Daniela Kühn
  • Tom Kelly
  • Dong Yeap Kang
  • Abhishek Methuku
  • Stefan Glock

The body of work demonstrates a consistent interest in combinatorial problems connected to graph and design theory, often engaging with structural and algorithmic aspects. The collaboration network and publication record indicate active contribution within a community focused on discrete mathematics and theoretical computer science.

Best Publications

  • Embedding large subgraphs into dense graphs

    Daniela Kühn;Deryk Osthus

  • The minimum degree threshold for perfect graph packings

    Daniela Kühn;Deryk Osthus

  • Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree

    Daniela Kühn;Deryk Osthus

  • Popularity based random graph models leading to a scale-free degree sequence

    Pierce G Buckley;Deryk Osthus

  • Hamilton decompositions of regular expanders: A proof of Kelly’s conjecture for large tournaments

    Daniela Kühn;Deryk Osthus

  • Matchings in hypergraphs of large minimum degree

    Unknown

  • Hamilton ℓ-cycles in uniform hypergraphs

    Daniela Kühn;Richard Mycroft;Deryk Osthus

  • Matchings in 3-uniform hypergraphs

    Daniela KüHn;Deryk Osthus;Andrew Treglown

  • Proof of the 1-factorization and Hamilton Decomposition Conjectures

    Béla Csaba;Daniela Kühn;Allan Lo;Deryk Osthus

  • Induced Subdivisions In K s,s -Free Graphs of Large Average Degree

    Daniela Kühn;Deryk Osthus

  • An exact minimum degree condition for Hamilton cycles in oriented graphs

    Peter Keevash;Daniela Kühn;Deryk Osthus

  • Loose Hamilton cycles in hypergraphs

    Peter Keevash;Daniela Kühn;Richard Mycroft;Deryk Osthus

  • A survey on Hamilton cycles in directed graphs

    Daniela Kühn;Deryk Osthus

  • The existence of designs via iterative absorption

    Stefan Glock;Daniela Kühn;Allan Lo;Deryk Osthus

  • Matchings in hypergraphs of large minimum degree

    Daniela Kühn;Deryk Osthus

  • Hamilton cycles in graphs and hypergraphs: an extremal perspective

    Daniela Kühn;Deryk Osthus

  • Edge-disjoint Hamilton cycles in random graphs

    Fiachra Knox;Daniela Kühn;Deryk Osthus

  • Hamiltonian degree sequences in digraphs

    Daniela Kühn;Deryk Osthus;Andrew Treglown

  • Uniform random sampling of planar graphs in linear time

    Nikolaos Fountoulakis;Daniela Kühn;Deryk Osthus

  • Edge-decompositions of graphs with high minimum degree

    Ben Barber;Daniela Kühn;Allan Lo;Deryk Osthus

  • Edge-disjoint Hamilton cycles in graphs

    Demetres Christofides;Daniela KüHn;Deryk Osthus

Frequent Co-Authors

Daniela Kühn
Daniela Kühn University of Birmingham
Yoshiharu Kohayakawa
Yoshiharu Kohayakawa Universidade de São Paulo

External Links

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, exploring related online degrees can open diverse career pathways. Many opt for an online MBA with transfer credits accepted, allowing them to leverage their quantitative skills while gaining business expertise. This flexibility can accelerate career advancement in data-driven industries.

Another popular choice is specialized programs like data analytics masters programs. These combine mathematical techniques with practical applications in big data, preparing graduates for roles in technology, finance, and healthcare sectors.

For those seeking a quicker entry into management roles, options such as the easiest MBA and easiest and fastest online MBA programs provide streamlined curricula. These programs are designed to be accessible and time-efficient, appealing to working professionals aiming to enhance leadership skills without extended time commitments.

Choosing the right pathway depends on career goals, prior education, and time availability. Exploring these options can help mathematics graduates expand their expertise and thrive in competitive job markets.

Best Scientists Citing Deryk Osthus

Trending Scientists