Deryk Osthus

Discrete Mathematics and Combinatorics · 2008–2016

A researcher in the Science corpus: 6 papers; trusts 16 researchers and is trusted by 4 researchers here, as inferred from the citation graph.

Subfields

• Discrete Mathematics and Combinatorics — 24 citations into it; #797 of 2,017 by trust here, #812 by citations
• Computational Theory and Mathematics — 21 citations into it; #5,173 of 12,182 by trust here, #7,851 by citations
• Geometry and Topology — 15 citations into it; #6,918 of 7,422 by trust here, #6,497 by citations
• Electrical and Electronic Engineering — 14 citations into it; #5,597 of 16,539 by trust here, #13,553 by citations

Whom Deryk Osthus trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Vojtech Rödl
2. Peter Keevash
3. Andrzej Rucinski
4. Michael Krivelevich
5. Endre Szemerédi
6. D. Kühn
7. Darryn E. Bryant
8. Alan M. Frieze

Who trusts Deryk Osthus overall

1. Peter Keevash
2. D. Kühn
3. Richard Mycroft

Papers from Deryk Osthus's perspective

Ordered by how strongly the researchers Deryk Osthus trusts endorse each paper. Same corpus, a different order for every researcher.

1. Reducibility Among Combinatorial Problems
2. A Dirac-Type Theorem for 3-Uniform Hypergraphs (Combinatorics, probability & computing)
3. Regularity Lemma for k‐uniform hypergraphs (Random Struct. Algorithms)
4. Combinatorial theorems in sparse random sets
5. The existence of designs
6. Hamilton cycles in graphs and hypergraphs: an extremal perspective
7. Digraphs - theory, algorithms and applications
8. Γ and B
9. Independent sets in hypergraphs
10. A proof of Lindner's conjecture on embeddings of partial Steiner triple systems

Their papers

• Hamilton cycles in graphs and hypergraphs: an extremal perspective (2014) — 92 citations
• Surveys in Combinatorics 2009: Embedding large subgraphs into dense graphs (2009) — 171 citations
• An exact minimum degree condition for Hamilton cycles in oriented graphs (2008) — 92 citations
• Proof of the 1-factorization and Hamilton Decomposition Conjectures (2014) — 117 citations
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (2016) — 91 citations
• The existence of designs via iterative absorption (2016) — 103 citations