Deryk Osthus

Last updated
Deryk Osthus
Alma mater University of Cambridge
Humboldt University of Berlin
Awards European Prize in Combinatorics (2003)
Whitehead Prize (2014)
Scientific career
Fields Mathematics
Institutions University of Birmingham

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. [1]

Contents

Career

Osthus earned a B.A. in mathematics from Cambridge University in 1996, followed by the Certificate of Advanced Studies in Mathematics (Part III) from Cambridge in 1997. He earned a PhD in theoretical computer science from Humboldt University of Berlin in 2000. From 2000 until 2004, he was a postdoctoral researcher in Berlin. He joined Birmingham University in 2004 as a lecturer. Working at the Birmingham University from 2004 to a 2010 as lecturer, Deryk was a promoted in 2010 to a senior lecturer. From 2011 to 2012, he was a reader in graph theory. He was appointed Professor in Graph Theory in 2012. [2]

Awards and honours

Together with Daniela Kühn and Alain Plagne, he was one of the first winners of the European Prize in Combinatorics in 2003. [3] Together with Kühn, he was a recipient of the 2014 Whitehead Prize of the London Mathematical Society for "their many results in extremal graph theory and related areas. Several of their papers resolve long-standing open problems in the area." [4] In 2014, he was also invited to a lecture at the International Congress of Mathematics in Seoul.

Grants

With the variety of intense research that Deryk Osthus was interested in, many grants were needed to conduct, analyze, and publish the research and publications that Deryk Osthus wanted to figure out, and gain more reliable and valid information on graph theories and other detailed areas. Throughout the years starting from the mid 2000's, many grants were accepted and given to Deryk Osthus in order to complete his research interests and potentially answer any research questions. In August 2007, Deryk Osthus was given his first grant for "Graph expansion and applications." Two months later, in October 2007 he was given another grant for "The regularity method for directed graphs." 3 years later in October 2010, he was given a grant for "Problems in Extremal Graph Theory." In June 2012, he had received a grant for "Edge-colourings and Hamilton decompositions of graphs." A few months later in December 2012, another grant was given to Deryk for "Asymptotic properties of graphs." 3 years later In March 2015, he received a grant for "Randomized approaches to combinatorial packing and covering problems." From January 2019 to the current date, he was given a grant for "Approximate structure in large graphs and hypergraphs."

Research Interests


With an education stemming back From the late 90's and early 2000's, Deryk Osthus had many areas of interest in the field of research. Deryk Osthus has done a variety of research in his area of interest, which resulted in a variety of different publications. Deryk's research interests are in extremal graph theory, random graphs, randomized algorithms, structural graph theory as well as Ramsey theory. His recent research has included results on Hamilton cycles and more general spanning substructures, as well as decompositions of graphs and hypergraphs.

Related Research Articles

<span class="mw-page-title-main">Complete graph</span> Graph in which every two vertices are adjacent

In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges.

<span class="mw-page-title-main">Fan Chung</span> American mathematician

Fan-Rong King Chung Graham, known professionally as Fan Chung, is an American mathematician who works mainly in the areas of spectral graph theory, extremal graph theory and random graphs, in particular in generalizing the Erdős–Rényi model for graphs with general degree distribution.

<span class="mw-page-title-main">Extremal graph theory</span>

Extremal graph theory is a branch of combinatorics, itself an area of mathematics, that lies at the intersection of extremal combinatorics and graph theory. In essence, extremal graph theory studies how global properties of a graph influence local substructure. Results in extremal graph theory deal with quantitative connections between various graph properties, both global and local, and problems in extremal graph theory can often be formulated as optimization problems: how big or small a parameter of a graph can be, given some constraints that the graph has to satisfy? A graph that is an optimal solution to such an optimization problem is called an extremal graph, and extremal graphs are important objects of study in extremal graph theory.

<span class="mw-page-title-main">Béla Bollobás</span> Hungarian mathematician

Béla Bollobás FRS is a Hungarian-born British mathematician who has worked in various areas of mathematics, including functional analysis, combinatorics, graph theory, and percolation. He was strongly influenced by Paul Erdős since the age of 14.

<span class="mw-page-title-main">Erdős–Faber–Lovász conjecture</span>

In graph theory, the Erdős–Faber–Lovász conjecture is a problem about graph coloring, named after Paul Erdős, Vance Faber, and László Lovász, who formulated it in 1972. It says:

The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at each (triennial) International Symposium of the MOS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS.

Joel Spencer is an American mathematician. He is a combinatorialist who has worked on probabilistic methods in combinatorics and on Ramsey theory. He received his doctorate from Harvard University in 1970, under the supervision of Andrew Gleason. He is currently a professor at the Courant Institute of Mathematical Sciences of New York University. Spencer's work was heavily influenced by Paul Erdős, with whom he coauthored many papers.

<span class="mw-page-title-main">Noga Alon</span> Israeli mathematician

Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.

<span class="mw-page-title-main">Václav Chvátal</span> Czech-Canadian mathematician

Václav (Vašek) Chvátal is a Professor Emeritus in the Department of Computer Science and Software Engineering at Concordia University in Montreal, Quebec, Canada, and a visiting professor at Charles University in Prague. He has published extensively on topics in graph theory, combinatorics, and combinatorial optimization.

Van H. Vu is a Vietnamese mathematician, Percey F. Smith Professor of Mathematics at Yale University.

<span class="mw-page-title-main">Hamiltonian decomposition</span>

In graph theory, a branch of mathematics, a Hamiltonian decomposition of a given graph is a partition of the edges of the graph into Hamiltonian cycles. Hamiltonian decompositions have been studied both for undirected graphs and for directed graphs. In the undirected case a Hamiltonian decomposition can also be described as a 2-factorization of the graph such that each factor is connected.

<span class="mw-page-title-main">Sumner's conjecture</span>

Sumner's conjecture states that every orientation of every -vertex tree is a subgraph of every -vertex tournament. David Sumner, a graph theorist at the University of South Carolina, conjectured in 1971 that tournaments are universal graphs for polytrees. The conjecture was proven for all large by Daniela Kühn, Richard Mycroft, and Deryk Osthus.

Vojtěch Rödl is a Czech American mathematician, Samuel Candler Dobbs Professor at Emory University. He is noted for his contributions mainly to combinatorics having authored hundreds of research papers.

Miklós Simonovits (4 September 1943 in Budapest) is a Hungarian mathematician who currently works at the Rényi Institute of Mathematics in Budapest and is a member of the Hungarian Academy of Sciences. He is on the advisory board of the journal Combinatorica. He is best known for his work in extremal graph theory and was awarded Széchenyi Prize in 2014. Among other things, he discovered the method of progressive induction which he used to describe graphs which do not contain a predetermined graph and the number of edges is close to maximal. With Lovász, he gave a randomized algorithm using O(n7 log2n) separation calls to approximate the volume of a convex body within a fixed relative error.

The European Prize in Combinatorics is a prize for research in combinatorics, a mathematical discipline, which is awarded biennially at Eurocomb, the European conference on combinatorics, graph theory, and applications. The prize was first awarded at Eurocomb 2003 in Prague. Recipients must not be older than 35. The most recent prize was awarded at Eurocomb 2023 in Prague.

Daniela Kühn is a German mathematician and the Mason Professor in Mathematics at the University of Birmingham in Birmingham, England. She is known for her research in combinatorics, and particularly in extremal combinatorics and graph theory.

Robert (Rob) Morris is a mathematician who works in combinatorics, probability, graph theory and Ramsey theory. He is a researcher at IMPA.

Wojciech Samotij is a Polish mathematician who works in combinatorics, additive number theory, Ramsey theory and graph theory.

József Balogh is a Hungarian-American mathematician, specializing in graph theory and combinatorics.

References

  1. ↑ "Professor Deryk Osthus". Birmingham University. Retrieved 7 August 2014.
  2. ↑ "Deryk Osthus: Short CV". Birmingham University. Retrieved 9 August 2014.
  3. ↑ "Awards" (PDF), European Mathematical Society Newsletter, 50: 24, December 2003
  4. ↑ "LMS Prizes 2014". London Mathematical Society. Retrieved 7 August 2014.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.