Deryk Osthus
#26,659
Most Influential Person Now
Mathematician
Deryk Osthus's AcademicÂInfluence.com Rankings
Deryk Osthusmathematics Degrees
Mathematics
#1816
World Rank
#2902
Historical Rank
Graph Theory
#35
World Rank
#42
Historical Rank
Combinatorics
#54
World Rank
#60
Historical Rank
Measure Theory
#3636
World Rank
#4289
Historical Rank
Download Badge
Mathematics
Why Is Deryk Osthus Influential?
(Suggest an Edit or Addition)According to Wikipedia, Deryk Osthus is the Professor of Graph Theory at the School of Mathematics, University of Birmingham. He is known for his research in combinatorics, predominantly in extremal and probabilistic graph theory.
Deryk Osthus's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Surveys in Combinatorics 2009: Embedding large subgraphs into dense graphs (2009) (143)
- The minimum degree threshold for perfect graph packings (2006) (137)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (2006) (120)
- Popularity based random graph models leading to a scale-free degree sequence (2004) (118)
- Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments (2012) (109)
- Proof of the 1-factorization and Hamilton Decomposition Conjectures (2014) (87)
- Matchings in hypergraphs of large minimum degree (2006) (86)
- Matchings in 3-uniform hypergraphs (2010) (77)
- The existence of designs via iterative absorption (2016) (76)
- A survey on Hamilton cycles in directed graphs (2010) (72)
- Hamiltonian degree sequences in digraphs (2008) (70)
- Hamilton l-cycles in uniform hypergraphs (2009) (70)
- Loose Hamilton cycles in hypergraphs (2008) (68)
- Hamilton cycles in graphs and hypergraphs: an extremal perspective (2014) (67)
- An exact minimum degree condition for Hamilton cycles in oriented graphs (2008) (64)
- Edge-decompositions of graphs with high minimum degree (2014) (61)
- The Existence of Designs via Iterative Absorption: Hypergraph đč-designs for Arbitrary đč (2016) (61)
- Induced Subdivisions In Ks,s-Free Graphs of Large Average Degree (2004) (60)
- Edgeâdisjoint Hamilton cycles in random graphs (2011) (60)
- Hamilton decompositions of regular expanders: Applications (2012) (58)
- Random maximal H-free graphs (2001) (55)
- Embeddings and Ramsey numbers of sparse Îș-uniform hypergraphs (2006) (53)
- On random planar graphs, the number of planar graphs and their triangulations (2003) (49)
- Minors in graphs of large girth (2003) (47)
- On PĂłsa's Conjecture for Random Graphs (2012) (43)
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs (2007) (41)
- For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? (2003) (37)
- A blow-up lemma for approximate decompositions (2016) (37)
- Topological Minors in Graphs of Large Girth (2002) (36)
- Critical chromatic number and the complexity of perfect packings in graphs (2006) (36)
- Edge-disjoint Hamilton cycles in graphs (2009) (36)
- Large planar subgraphs in dense graphs (2005) (36)
- A proof of Sumner's universal tournament conjecture for large tournaments (2010) (31)
- Hamilton decompositions of regular tournaments (2009) (30)
- On the decomposition threshold of a given graph (2016) (30)
- Fractional and integer matchings in uniform hypergraphs (2013) (30)
- Forcing unbalanced complete bipartite minors (2005) (29)
- Hypergraph $F$-designs for arbitrary $F$ (2017) (29)
- Optimal packings of bounded degree trees (2016) (29)
- Clique decompositions of multipartite graphs and completion of Latin squares (2016) (28)
- Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree (2012) (27)
- An approximate version of SumnerÊŒs universal tournament conjecture (2010) (27)
- An Ore-type Theorem for Perfect Packings in Graphs (2008) (26)
- Fractional clique decompositions of dense graphs and hypergraphs (2015) (26)
- Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree (2004) (26)
- Complete Minors In Ks,s-Free Graphs (2004) (25)
- Cycles of given length in oriented graphs (2008) (25)
- Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments (2013) (24)
- 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers (2006) (24)
- Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths (2013) (24)
- The order of the largest complete minor in a random graph (2007) (23)
- Approximate Hamilton decompositions of random graphs (2010) (23)
- On a Conjecture of ErdĆs on Locally Sparse Steiner Triple Systems (2020) (23)
- Optimal path and cycle decompositions of dense quasirandom graphs (2015) (22)
- Partitions of graphs with high minimum degree or connectivity (2003) (22)
- Resolution of the Oberwolfach problem (2018) (22)
- Decompositions of complete uniform hypergraphs into Hamilton Berge cycles (2014) (21)
- Minors in random regular graphs (2008) (21)
- The robust component structure of dense regular graphs and applications (2014) (20)
- Finding Hamilton cycles in robustly expanding digraphs (2012) (20)
- On the structure of oriented graphs and digraphs with forbidden tournaments or cycles (2014) (19)
- Spanning triangulations in graphs (2005) (18)
- Decompositions into isomorphic rainbow spanning trees (2019) (18)
- Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs (2006) (18)
- Improved Bounds for Topological Cliques in Graphs of Large Girth (2006) (18)
- Rainbow structures in locally bounded colorings of graphs (2018) (17)
- A Semiexact Degree Condition for Hamilton Cycles in Digraphs (2010) (17)
- Large Topological Cliques in Graphs Without a 4-Cycle (2004) (17)
- Maximum Antichains in Random Subsets of a Finite Set (2000) (16)
- Maximizing Several Cuts Simultaneously (2005) (13)
- Fourâcycles in graphs without a given even cycle (2005) (13)
- Hamiltonicity of random subgraphs of the hypercube (2020) (13)
- Minimalist designs (2018) (12)
- A bandwidth theorem for approximate decompositions (2017) (12)
- Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs (2012) (11)
- Arbitrary Orientations of Hamilton Cycles in Digraphs (2014) (11)
- Optimal covers with Hamilton cycles in random graphs (2012) (11)
- Perfect packings with complete graphs minus an edge (2006) (11)
- Extremal connectivity for topological cliques in bipartite graphs (2006) (11)
- Multicoloured Hamilton cycles and perfect matchings in pseudo-random graphs (2004) (11)
- On the Random Greedy F-Free Hypergraph Process (2015) (10)
- The length of random subsets of Boolean lattices (2000) (10)
- Solution to a problem of BollobĂĄs and HĂ€ggkvist on Hamilton cycles in regular graphs (2014) (10)
- Extremal aspects of graph and hypergraph decomposition problems (2020) (10)
- Hamilton l-cycles in k-graphs (2009) (9)
- Linkedness and Ordered Cycles in Digraphs (2007) (9)
- Graph and hypergraph colouring via nibble methods: A survey (2021) (8)
- Bipartitions of Highly Connected Tournaments (2014) (8)
- On a conjecture of Erd\H{o}s on locally sparse Steiner triple systems (2018) (8)
- Hamilton decompositions of regular expanders (2016) (7)
- Euler Tours in Hypergraphs (2018) (7)
- Subdivisions of $K_{r+2}$ in Graphs of Average Degree at Least $r+\varepsilon$ and Large but Constant Girth (2004) (6)
- Path and cycle decompositions of dense graphs (2019) (6)
- A note on complete subdivisions in digraphs of large outdegree (2006) (6)
- k-Ordered Hamilton cycles in digraphs (2007) (6)
- Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing (2018) (5)
- Packings in Dense Regular Graphs (2005) (5)
- Resilient Degree Sequences with respect to Hamilton Cycles and Matchings in Random Graphs (2018) (5)
- Diracâs theorem for random regular graphs (2019) (4)
- Forbidding induced even cycles in a graph: Typical structure and counting (2015) (4)
- A proof of the Erdös-Faber-Lovåsz conjecture: Algorithmic aspects (2022) (4)
- Embedding cycles of given length in oriented graphs (2011) (4)
- A Characterization of Testable Hypergraph Properties (2017) (4)
- A domination algorithm for {0,1}âinstances of the travelling salesman problem (2014) (3)
- New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs. (2020) (3)
- Almost all graphs with high girth and suitable density have high chromatic number (2001) (3)
- Counting Hamilton cycles in Dirac hypergraphs (2019) (3)
- Four-cycles in graphs without a given even cycle (2005) (3)
- On the evolution of random discrete structures (2000) (2)
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (2022) (2)
- Subdivisions of K r + 2 in graphs of average degree at least r + Δ and large but constant girth (2002) (2)
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path (2020) (2)
- Matchings in 3-uniform hypergraphs of large minimum vertex degree (2011) (2)
- A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree (2021) (2)
- Solution to a problem of Erd\H{o}s on the chromatic index of hypergraphs with bounded codegree (2021) (2)
- A SEMIEXACT DEGREE CONDITION FOR HAMILTON CYCLES (2010) (1)
- Ramsey numbers of sparse hypergraphs (2007) (1)
- Perfect matchings in random sparsifications of Dirac hypergraphs (2022) (1)
- A proof of the Erd\H{o}s-Faber-Lov\'asz conjecture (2021) (1)
- Matchings and Hamilton cycles in hypergraphs (2005) (1)
- A minimum degree condition forcing a digraph to be k-linked (2007) (0)
- University of Birmingham Euler tours in hypergraphs (2020) (0)
- A characterization of testable hypergraph properties [ Extended Abstract ] (2017) (0)
- Short cycles in oriented graphs (2009) (0)
- Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths (2015) (0)
- Tuesday ( Including celebration of Tutte centenary ) (2017) (0)
- Path decompositions of tournaments (2020) (0)
- A simple solution to Ulam's liar game with one lie (2007) (0)
- $K_{\ell}^{-}$-factors in graphs (2005) (0)
- Resilience with respect to Hamiltonicity in random graphs (2019) (0)
- University of Birmingham Decompositions into isomorphic rainbow spanning trees (2020) (0)
- HAMILTON `-CYCLES IN k-GRAPHS (2009) (0)
- University of Birmingham Resolution of the Oberwolfach problem (2021) (0)
- Euler Tours in Hypergraphs (2020) (0)
- Matchings, Hamilton cycles and cycle packings in uniform hypergraphs (2005) (0)
- Maximum Anti hains in Random Subsets of aFinite (2007) (0)
- K â `-factors in graphs (2005) (0)
- Optimal covers with Hamilton cycles in random graphs (2014) (0)
- University of Birmingham Arbitrary orientations of Hamilton cycles in digraphs (2015) (0)
- Hypergraph regularity and random sampling (2021) (0)
- K_lâ-factors in graphs (2020) (0)
- University of Birmingham Fractional clique decompositions of dense graphs (2017) (0)
- On a Conjecture of ErdĆs on Locally Sparse Steiner Triple Systems (2020) (0)
- -factors in graphs (2018) (0)
- Degree sequences forcing Hamilton cycles in directed graphs (2009) (0)
- University of Birmingham On a conjecture of Erds on locally sparse Steiner triple systems (2019) (0)
- University of Birmingham Bipartitions of Highly Connected Tournaments (2016) (0)
- University of Birmingham A domination algorithm for {0,1}-instances of the travelling salesman problem (2015) (0)
- University of Birmingham Path and cycle decompositions of dense graphs (2020) (0)
- University of Birmingham Counting Hamilton cycles in Dirac hypergraphs (2021) (0)
- Counting tight Hamilton cycles and perfect matchings in Dirac hypergraphs (2019) (0)
This paper list is powered by the following services:
Other Resources About Deryk Osthus
What Schools Are Affiliated With Deryk Osthus?
Deryk Osthus is affiliated with the following schools:
