Daniela Kühn
| Daniela Kühn | |
|---|---|
| Born | 1973 |
| Fields | Mathematics |
| Institutions | University of Birmingham |
| Alma mater |
University of Cambridge Chemnitz University of Technology University of Hamburg |
| Known for | contributions to extremal combinatorics and graph theory |
| Notable awards |
European Prize in Combinatorics (2003) Whitehead Prize (2014) |
Daniela Kühn is a German mathematician and the Mason Professor in Mathematics at the University of Birmingham in Birmingham, England.[1] She is known for her research in combinatorics, and particularly in extremal combinatorics and graph theory.
Biography
Kühn earned the Certificate of Advanced Studies in Mathematics (Cambridge Mathematical Tripos) from Cambridge University in 1997 and a Diploma in Mathematics from the Chemnitz University of Technology in 1999,[1] followed by her doctorate from the University of Hamburg in 2001, under the supervision of Reinhard Diestel.[2] After working as a postdoctoral researcher at Hamburg and the Free University of Berlin, she moved to the University of Birmingham as a lecturer in 2004, and was awarded the Mason Chair of Mathematics in 2010.[1]
Research
In 2004 Kühn's published a pair of papers in Combinatorica with her thesis advisor, Reinhard Diestel, concerning the cycle spaces of infinite graphs. In these graphs the appropriate generalizations of cycles and spanning trees hinge on a proper treatment of the ends of the graph. Reviewer R. Bruce Richter writes that "the results are extremely satisfactory, in the sense that standard theorems for finite graphs have perfect analogues" but that "there is nothing simple about any aspect of this work. It is a nice mix of graph-theoretic and topological ideas."[3]
In 2011, Kühn and her co-authors published a proof of Sumner's conjecture, that every n-vertex polytree forms a subgraph of every (2n − 2)-vertex tournament, for all but finitely many values of n. MathSciNet reviewer K. B. Reid wrote that their proof "is an important and welcome development in tournament theory".[4]
Awards and honours
In 2002, Kühn won the Richard Rado Prize, a biennial best dissertation award given by the Section for Discrete Mathematics of the German Mathematical Society.[5] Together with Deryk Osthus and Alain Plagne, she was one of the first winners of the European Prize in Combinatorics in 2003.[6] Together with Osthus, she 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."[7] She was an Invited Speaker at the 2014 International Congress of Mathematicians, in Seoul.[8] and appointed as a Royal Society Wolfson Research Merit Award holder in 2015.[9]
References
- 1 2 3 Staff profile, University of Birmingham School of Mathematics, accessed 2012-09-12.
- ↑ Daniela Kühn at the Mathematics Genealogy Project
- ↑ Diestel, Reinhard; Kühn, Daniela (2004), "On infinite cycles. I, II.", Combinatorica, 24 (1): 69–89 & 91–116, doi:10.1007/s00493-004-0005-z, MR 2057684. See in particular Richter's review in the MR link.
- ↑ Kühn, Daniela; Mycroft, Richard; Osthus, Deryk (2011), "A proof of Sumner's universal tournament conjecture for large tournaments", Proceedings of the London Mathematical Society, Third Series, 102 (4): 731–766, arXiv:1010.4430
, doi:10.1112/plms/pdq035, MR 2793448, Zbl 1218.05034. - ↑ Richard-Rado-Preis (in German), Fachgruppe Diskrete Mathematik, DMV, accessed 2012-09-12.
- ↑ "Awards" (PDF), European Mathematical Society Newsletter, 50: 24, December 2003.
- ↑ "LMS Prizes 2014". London Mathematical Society. Retrieved 7 August 2014.
- ↑ "ICM Plenary and Invited Speakers since 1897". International Mathematical Union (IMU). 2015-09-27. Retrieved 2015-09-27.
- ↑ "Royal Society announces recipients of prestigious Wolfson Research Merit Awards". Royal Society. 31 July 2015. Retrieved 2015-09-27.