- Home
- Best Scientists - Mathematics
- Deryk Osthus

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
32
Citations
3,501
124
World Ranking
7539
National Ranking
431

Mathematics
D-index
32
Citations
3,578
127
World Ranking
1879
National Ranking
115

- Combinatorics
- Discrete mathematics
- Graph theory

Deryk Osthus mainly focuses on Combinatorics, Discrete mathematics, Conjecture, Graph and Hamiltonian path. Hypergraph, Degree, Random graph, Digraph and Lemma are among the areas of Combinatorics where Deryk Osthus concentrates his study. His Degree research incorporates elements of Almost surely and Vertex.

As part of one scientific family, Deryk Osthus deals mainly with the area of Discrete mathematics, narrowing it down to issues related to the Matching, and often Range. His research investigates the connection with Conjecture and areas like Tournament which intersect with concerns in Directed graph. His work on Regular graph as part of general Graph study is frequently connected to Factorization, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.

- The minimum degree threshold for perfect graph packings (141 citations)
- Embedding large subgraphs into dense graphs (141 citations)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (112 citations)

Deryk Osthus mostly deals with Combinatorics, Discrete mathematics, Conjecture, Graph and Hypergraph. His study in Degree, Hamiltonian path, Random graph, Tournament and Digraph falls within the category of Combinatorics. The study incorporates disciplines such as Almost surely and Graph theory in addition to Discrete mathematics.

His Conjecture study integrates concerns from other disciplines, such as Sequence, Bounded function and Vertex. His work on Bipartite graph, Complete graph and Spanning subgraph as part of general Graph research is frequently linked to Subdivision, bridging the gap between disciplines. His work carried out in the field of Hypergraph brings together such families of science as Matching, Edge and Divisibility rule.

- Combinatorics (96.95%)
- Discrete mathematics (48.73%)
- Conjecture (43.65%)

- Combinatorics (96.95%)
- Conjecture (43.65%)
- Graph (39.59%)

Deryk Osthus mostly deals with Combinatorics, Conjecture, Graph, Hypergraph and Bounded function. He integrates several fields in his works, including Combinatorics and Rainbow. He focuses mostly in the field of Conjecture, narrowing it down to matters related to Steiner system and, in some cases, If and only if.

His research on Hypergraph concerns the broader Discrete mathematics. Many of his research projects under Discrete mathematics are closely connected to Resolution with Resolution, tying the diverse disciplines of science together. Deryk Osthus interconnects Characterization, Randomized algorithm, Lemma and Bipartite graph in the investigation of issues within Bounded function.

- A blow-up lemma for approximate decompositions (30 citations)
- Optimal packings of bounded degree trees (25 citations)
- Hypergraph $F$-designs for arbitrary $F$ (23 citations)

- Combinatorics
- Discrete mathematics
- Graph theory

Deryk Osthus mainly focuses on Combinatorics, Conjecture, Graph, Bounded function and Hypergraph. Deryk Osthus performs integrative study on Combinatorics and Rainbow in his works. His study looks at the relationship between Bounded function and topics such as Lemma, which overlap with Tree, Degree and Sequence.

His Hypergraph study is associated with Discrete mathematics. His biological study spans a wide range of topics, including Vertex and Vertex. The Existential quantification study combines topics in areas such as Steiner system, If and only if and Girth.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Embedding large subgraphs into dense graphs

Daniela Kühn;Deryk Osthus.

arXiv: Combinatorics **(2009)**

209 Citations

The minimum degree threshold for perfect graph packings

Daniela Kühn;Deryk Osthus.

Combinatorica **(2009)**

141 Citations

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

Pierce G Buckley;Deryk Osthus.

Discrete Mathematics **(2004)**

139 Citations

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

Daniela Kühn;Deryk Osthus.

Journal of Combinatorial Theory, Series B **(2006)**

129 Citations

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

Daniela Kühn;Deryk Osthus.

Advances in Mathematics **(2013)**

101 Citations

Matchings in hypergraphs of large minimum degree

Daniela Kühn;Deryk Osthus.

Journal of Graph Theory **(2006)**

81 Citations

Hamilton ℓ-cycles in uniform hypergraphs

Daniela Kühn;Richard Mycroft;Deryk Osthus.

Journal of Combinatorial Theory, Series A **(2010)**

77 Citations

Edge-disjoint Hamilton cycles in graphs

Demetres Christofides;Daniela KüHn;Deryk Osthus.

Journal of Combinatorial Theory, Series B **(2012)**

76 Citations

Uniform random sampling of planar graphs in linear time

Nikolaos Fountoulakis;Daniela Kühn;Deryk Osthus.

Random Structures and Algorithms **(2009)**

74 Citations

The existence of designs via iterative absorption

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

arXiv: Combinatorics **(2016)**

72 Citations

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

Contact us

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:

University of Birmingham

Universidade de São Paulo

Something went wrong. Please try again later.