Daniela Kühn received her mathematical education in Chemnitz, Cambridge and Hamburg. She moved to Birmingham in 2004, where she founded a Combinatorics research group with Deryk Osthus. She was appointed Mason Chair in Mathematics in 2010.
Her research focuses on the theory of large networks (also referred to as graphs). Her results (with Deryk Osthus and their team members in Birmingham) include a proof of the 1-factorization conjecture on edge-colourings of a graph, a proof of Kelly’s conjecture on decomposing a tournament into spanning cycles, a proof of the Erdös-Faber-Lovász-conjecture on edge-colourings of hypergraphs and a combinatorial proof of the existence of designs. She has also considered computational aspects of large networks: in particular, she characterized those hypergraph properties which are efficiently testable.
Honours and awards include invited lectures at the International Congress of Mathematicians in 2014 as well as the European Congress of Mathematics in 2021, the European Prize in Combinatorics in 2003, a Whitehead prize in 2014, a Royal Society research merit award in 2015 and the Fulkerson prize in 2021.
Professional position
- Mason Professor of Mathematics, School of Mathematics, University of Birmingham
Subject groups
-
Mathematics
Pure mathematics
