Deryk Osthus
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Limits and Structures in Graph Theory 94
- Finite Group Theory Research 10
-
- Advanced Graph Theory Research 81
- Graph Labeling and Dimension Problems 17
- Complexity and Algorithms in Graphs 11
- Co-authors
- Daniela KühnAndrew TreglownAnusch TarazRichard MycroftAllan LoNikolaos FountoulakisPeter KeevashStefan Glock
- Journals
- Journal of Combinatorial Theory Series B (21 papers)Random Structures and Algorithms (12 papers)COMBINATORICA (11 papers)SIAM Journal on Discrete Mathematics (7 papers)Combinatorics Probability Computing (7 papers)
- Partner nations
- United KingdomGermanyUnited States
In The Last Decade
Deryk Osthus
92 papers receiving 1.2k citations
Peers
Comparison fields: 5 of 47
- Discrete Mathematics and Combinatorics 1.1k
- Computational Theory and Mathematics 1.0k
- Geometry and Topology 511
- Computational Mathematics 11
- Mathematical Physics 73
Countries citing papers authored by Deryk Osthus
This map shows the geographic impact of Deryk Osthus's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Deryk Osthus with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Deryk Osthus more than expected).
Fields of papers citing papers by Deryk Osthus
This network shows the impact of papers produced by Deryk Osthus. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Deryk Osthus. The network helps show where Deryk Osthus may publish in the future.
Co-authorship network
The 20 scholars most cited alongside Deryk Osthus, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2023 | 6 | |
| 2 | 2019 | 2 | |
| 3 | 2017 | 7 | |
| 4 | 2017 | 7 | |
| 5 | 2015 | 1 | |
| 6 | Proof of the 1-factorization and Hamilton decomposition conjectures I: the two cliques case | 2014 | 4 |
| 7 | 2013 | 17 | |
| 8 | 2012 | 48 | |
| 9 | 2011 | 35 | |
| 10 | 2011 | 9 | |
| 11 | Hamilton decompositions of regular tournaments | 2010 | 12 |
| 12 | Hamilton l-cycles in k-graphs | 2009 | 5 |
| 13 | 2009 | 7 | |
| 14 | 2008 | 10 | |
| 15 | 2007 | 4 | |
| 16 | 2006 | 45 | |
| 17 | 2006 | 13 | |
| 18 | 2006 | 72 | |
| 19 | 2004 | 21 | |
| 20 | 2002 | 22 |
About Deryk Osthus
Deryk Osthus is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Electrical and Electronic Engineering and Computer Graphics and Computer-Aided Design, having authored 100 papers that have together received 1.3k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (94 papers), Advanced Graph Theory Research (81 papers), graph theory and CDMA systems (43 papers), Graph theory and applications (20 papers), Graph Labeling and Dimension Problems (17 papers), Complexity and Algorithms in Graphs (11 papers), Finite Group Theory Research (10 papers) and Advanced Topology and Set Theory (9 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.1k citations), Computational Theory and Mathematics (1.0k citations), Geometry and Topology (511 citations), Computational Mathematics (11 citations) and Mathematical Physics (73 citations). Deryk Osthus has collaborated with scholars based in United Kingdom, Germany and United States. Frequent co-authors include Daniela Kühn, Andrew Treglown, Anusch Taraz, Richard Mycroft, Allan Lo, Nikolaos Fountoulakis, Peter Keevash, Stefan Glock, Hans Jürgen Prömel and Jaehoon Kim. Their work appears in journals such as Journal of Combinatorial Theory Series B, Random Structures and Algorithms, COMBINATORICA, SIAM Journal on Discrete Mathematics and Combinatorics Probability Computing.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.