Deryk Osthus

Deryk Osthus

University of Birmingham

H-index: 36

Europe-United Kingdom

About Deryk Osthus

Deryk Osthus, With an exceptional h-index of 36 and a recent h-index of 24 (since 2020), a distinguished researcher at University of Birmingham, specializes in the field of Combinatorics, Graph theory, Discrete Mathematics, Theoretical Computer Science.

His recent articles reflect a diverse array of research interests and contributions to the field:

A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree

Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor

A proof of the Erdős--Faber--Lovász conjecture

Hypergraph regularity and random sampling

Path decompositions of tournaments

New bounds on the size of nearly perfect matchings in almost regular hypergraphs

Almost all optimally coloured complete graphs contain a rainbow Hamilton path

A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects

Deryk Osthus Information

University

Position

___

Citations(all)

3947

Citations(since 2020)

1737

Cited By

2984

hIndex(all)

36

hIndex(since 2020)

24

i10Index(all)

92

i10Index(since 2020)

59

Email

University Profile Page

Google Scholar

Deryk Osthus Skills & Research Interests

Combinatorics

Graph theory

Discrete Mathematics

Theoretical Computer Science

Top articles of Deryk Osthus

Title

Journal

Author(s)

Publication Date

A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree

Combinatorics, Probability and Computing

Tom Kelly

Daniela Kühn

Deryk Osthus

2024/3

Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor

Transactions of the American Mathematical Society

Dong Yeap Kang

Tom Kelly

Daniela Kühn

Abhishek Methuku

Deryk Osthus

2023/9

A proof of the Erdős--Faber--Lovász conjecture

Annals of Mathematics

Dong Kang

Tom Kelly

Daniela Kühn

Abhishek Methuku

Deryk Osthus

2023/9/1

Hypergraph regularity and random sampling

Random Structures & Algorithms

Felix Joos

Jaehoon Kim

Daniela Kühn

Deryk Osthus

2023/7

Path decompositions of tournaments

Proceedings of the London Mathematical Society

António Girão

Bertille Granet

Daniela Kühn

Allan Lo

Deryk Osthus

2023/2

New bounds on the size of nearly perfect matchings in almost regular hypergraphs

Journal of the London Mathematical Society

Dong Yeap Kang

Daniela Kühn

Abhishek Methuku

Deryk Osthus

2023/11

Almost all optimally coloured complete graphs contain a rainbow Hamilton path

Journal of Combinatorial Theory, Series B

Stephen Gould

Tom Kelly

Daniela Kühn

Deryk Osthus

2022/9/1

A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects

Dong Yeap Kang

Tom Kelly

Daniela Kühn

Abhishek Methuku

Deryk Osthus

2022/2/7

Perfect matchings in random sparsifications of Dirac hypergraphs

arXiv preprint arXiv:2211.01325

Dong Yeap Kang

Tom Kelly

Daniela Kühn

Deryk Osthus

Vincent Pfenninger

2022/11/2

Dirac’s theorem for random regular graphs

Combinatorics, Probability and Computing

Padraig Condon

Alberto Espuny Díaz

António Girão

Daniela Kühn

Deryk Osthus

2021/1

Graph and hypergraph colouring via nibble methods: A survey

arXiv preprint arXiv:2106.13733

Dong Yeap Kang

Tom Kelly

Daniela Kühn

Abhishek Methuku

Deryk Osthus

2021/6/25

Decompositions into isomorphic rainbow spanning trees

Journal of Combinatorial Theory, Series B

Stefan Glock

Daniela Kühn

Richard Montgomery

Deryk Osthus

2021/1/1

Extremal aspects of graph and hypergraph decomposition problems.

Stefan Glock

Daniela Kühn

Deryk Osthus

2021/6/24

Solution to a problem of Erd\H {o} s on the chromatic index of hypergraphs with bounded codegree

arXiv preprint arXiv:2110.06181

Dong Yeap Kang

Tom Kelly

Daniela Kühn

Abhishek Methuku

Deryk Osthus

2021/10/12

Resolution of the Oberwolfach problem

Journal of the European Mathematical Society

Stefan Glock

Felix Joos

Jaehoon Kim

Daniela Kühn

Deryk Osthus

2021

A proof of the Erdös-Faber-Lovász conjecture

arXiv preprint

D Kang

Tom Kelly

D Kühn

Abhishek Methuku

Deryk Osthus

2021

Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree

arXiv e-prints

Dong Yeap Kang

Tom Kelly

Daniela Kühn

Abhishek Methuku

Deryk Osthus

2021/10

A proof of the Erdős-Faber-Lovász conjecture

arXiv e-prints

Dong Yeap Kang

Tom Kelly

Daniela Kühn

Abhishek Methuku

Deryk Osthus

2021/1

Path and cycle decompositions of dense graphs

Journal of the London Mathematical Society

António Girão

Bertille Granet

Daniela Kühn

Deryk Osthus

2021/10

Hamiltonicity of random subgraphs of the hypercube

Padraig Condon

Alberto Espuny Díaz

António Girao

Daniela Kühn

Deryk Osthus

2021

See List of Professors in Deryk Osthus University(University of Birmingham)

Co-Authors

academic-engine