World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

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

Computer Science

D-Index
38
Citations
4484
World Ranking
10408
National Ranking
654

Deryk Osthus publication distribution in Mathematics in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Mathematics in 2026. The highlighted bar marks where Deryk Osthus sits on this spectrum.

42–46 publications: 3 scientists 47–51 publications: 5 scientists 52–56 publications: 7 scientists 57–61 publications: 20 scientists 62–66 publications: 14 scientists 67–71 publications: 25 scientists 72–76 publications: 19 scientists 77–81 publications: 35 scientists 82–86 publications: 50 scientists 87–91 publications: 60 scientists 92–96 publications: 86 scientists 97–101 publications: 84 scientists 102–106 publications: 83 scientists 107–111 publications: 90 scientists 112–116 publications: 99 scientists 117–121 publications: 90 scientists 122–126 publications: 91 scientists 127–131 publications: 109 scientists 132–136 publications: 110 scientists 137–141 publications: 98 scientists 142–146 publications: 112 scientists 147–151 publications: 102 scientists 152–156 publications: 88 scientists 157–161 publications: 106 scientists 162–166 publications: 83 scientists 167–171 publications: 102 scientists 172–176 publications: 77 scientists 177–181 publications: 81 scientists 182–186 publications: 78 scientists 187–191 publications: 71 scientists 192–196 publications: 92 scientists 197–201 publications: 64 scientists 202–206 publications: 69 scientists 207–211 publications: 64 scientists 212–216 publications: 62 scientists 217–221 publications: 58 scientists 222–226 publications: 53 scientists 227–231 publications: 50 scientists 232–236 publications: 46 scientists 237–241 publications: 46 scientists 242–246 publications: 46 scientists 247–251 publications: 43 scientists 252–256 publications: 29 scientists 257–261 publications: 45 scientists 262–266 publications: 30 scientists 267–271 publications: 33 scientists 272–276 publications: 34 scientists 277–281 publications: 30 scientists 282–286 publications: 31 scientists 287–291 publications: 21 scientists 292–296 publications: 34 scientists 297–301 publications: 26 scientists 302–306 publications: 10 scientists 307–311 publications: 17 scientists 312–316 publications: 23 scientists 317–321 publications: 13 scientists 322–326 publications: 16 scientists 327–331 publications: 26 scientists 332–336 publications: 13 scientists 337–341 publications: 13 scientists 342–346 publications: 16 scientists 347–351 publications: 17 scientists 352–356 publications: 12 scientists 357–361 publications: 18 scientists 362–366 publications: 18 scientists 367–371 publications: 9 scientists 372–376 publications: 11 scientists 377–381 publications: 8 scientists 382–386 publications: 8 scientists 387–391 publications: 9 scientists 392–396 publications: 9 scientists 397–401 publications: 8 scientists 402–406 publications: 11 scientists 407–411 publications: 6 scientists 412–416 publications: 6 scientists 417–421 publications: 9 scientists 422–426 publications: 8 scientists 427–431 publications: 5 scientists 432–436 publications: 8 scientists 437–441 publications: 8 scientists 442–446 publications: 4 scientists 447–451 publications: 4 scientists 452–456 publications: 4 scientists 457–461 publications: 2 scientists 462–466 publications: 2 scientists 467–471 publications: 4 scientists 472–476 publications: 3 scientists 477–481 publications: 3 scientists 482–486 publications: 6 scientists 487–491 publications: 3 scientists 492–496 publications: 5 scientists 497–501 publications: 5 scientists 502–506 publications: 1 scientists 507–511 publications: 6 scientists 512–516 publications: 4 scientists 517–521 publications: 1 scientists 522–526 publications: 3 scientists 527–531 publications: 1 scientists 532–536 publications: 4 scientists 537+ publications: 100 scientists
42 publications 537+

This scientist: 147 publications — 36th percentile

36% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 537 publications or more.

Deryk Osthus D-index placement in Mathematics in 2026

The chart shows the D-index (discipline H-index) distribution of Mathematics scientists ranked by Research.com in 2026. The highlighted bar marks where Deryk Osthus sits on this spectrum.

30 D-Index: 174 scientists 31 D-Index: 151 scientists 32 D-Index: 174 scientists 33 D-Index: 117 scientists 34 D-Index: 136 scientists 35 D-Index: 127 scientists 36 D-Index: 145 scientists 37 D-Index: 153 scientists 38 D-Index: 150 scientists 39 D-Index: 150 scientists 40 D-Index: 138 scientists 41 D-Index: 136 scientists 42 D-Index: 93 scientists 43 D-Index: 108 scientists 44 D-Index: 115 scientists 45 D-Index: 112 scientists 46 D-Index: 103 scientists 47 D-Index: 75 scientists 48 D-Index: 59 scientists 49 D-Index: 67 scientists 50 D-Index: 60 scientists 51 D-Index: 57 scientists 52 D-Index: 59 scientists 53 D-Index: 62 scientists 54 D-Index: 60 scientists 55 D-Index: 50 scientists 56 D-Index: 42 scientists 57 D-Index: 54 scientists 58 D-Index: 50 scientists 59 D-Index: 42 scientists 60 D-Index: 41 scientists 61 D-Index: 35 scientists 62 D-Index: 40 scientists 63 D-Index: 21 scientists 64 D-Index: 31 scientists 65 D-Index: 27 scientists 66 D-Index: 29 scientists 67 D-Index: 19 scientists 68 D-Index: 25 scientists 69 D-Index: 17 scientists 70 D-Index: 18 scientists 71 D-Index: 12 scientists 72 D-Index: 14 scientists 73 D-Index: 13 scientists 74 D-Index: 18 scientists 75 D-Index: 9 scientists 76 D-Index: 11 scientists 77 D-Index: 10 scientists 78 D-Index: 9 scientists 79 D-Index: 16 scientists 80 D-Index: 12 scientists 81 D-Index: 10 scientists 82 D-Index: 5 scientists 83 D-Index: 5 scientists 84 D-Index: 13 scientists 85 D-Index: 6 scientists 86+ D-Index: 99 scientists
30 D-Index 86+

This scientist: 38 D-Index — 37th percentile

37% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 86 D-Index or more.

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

Recently Published Articles