Daniela Kühn | Academic Influence

Daniela Kühn's AcademicInfluence.com Rankings

Daniela Kühn

Mathematics

#1687

World Rank

#2711

Historical Rank

Graph Theory

#40

World Rank

#47

Historical Rank

Combinatorics

#46

World Rank

#51

Historical Rank

Measure Theory

#3740

World Rank

#4410

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Daniela Kühn's Degrees

Masters Mathematics University of Bonn
Bachelors Mathematics University of Bonn

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Daniela Kühn Influential?

(Suggest an Edit or Addition)

According to Wikipedia, 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.

(See a Problem?)

Daniela Kühn'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

The minimum degree threshold for perfect graph packings (2006) (137)
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (2006) (120)
Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments (2012) (109)
Graph-theoretical versus topological ends of graphs (2003) (103)
On Infinite Cycles I (2004) (93)
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)
Topological paths, cycles and spanning trees in infinite graphs (2004) (72)
Hamilton l-cycles in uniform hypergraphs (2009) (70)
Hamiltonian degree sequences in digraphs (2008) (70)
Loose Hamilton cycles in hypergraphs (2008) (68)
An exact minimum degree condition for Hamilton cycles in oriented graphs (2008) (64)
On Infinite Cycles II (2004) (62)
Edge-decompositions of graphs with high minimum degree (2014) (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)
Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs (2006) (53)
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)
Large planar subgraphs in dense graphs (2005) (36)
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)
A proof of Sumner's universal tournament conjecture for large tournaments (2010) (31)
Hamilton decompositions of regular tournaments (2009) (30)
Fractional and integer matchings in uniform hypergraphs (2013) (30)
On the decomposition threshold of a given graph (2016) (30)
Forcing unbalanced complete bipartite minors (2005) (29)
Clique decompositions of multipartite graphs and completion of Latin squares (2016) (28)
Graph minor hierarchies (2005) (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)
Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree (2004) (26)
Fractional clique decompositions of dense graphs and hypergraphs (2015) (26)
An Ore-type Theorem for Perfect Packings in Graphs (2008) (26)
Complete Minors In Ks,s-Free Graphs (2004) (25)
Cycles of given length in oriented graphs (2008) (25)
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers (2006) (24)
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments (2013) (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)
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)
Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs (2006) (18)
Improved Bounds for Topological Cliques in Graphs of Large Girth (2006) (18)
Decompositions into isomorphic rainbow spanning trees (2019) (18)
Spanning triangulations in graphs (2005) (18)
A Semiexact Degree Condition for Hamilton Cycles in Digraphs (2010) (17)
Rainbow structures in locally bounded colorings of graphs (2018) (17)
Large Topological Cliques in Graphs Without a 4-Cycle (2004) (17)
Automatic Exploration of Machine Learning Experiments on OpenML (2018) (16)
Maximizing Several Cuts Simultaneously (2005) (13)
On well-quasi-ordering infinite trees – Nash–Williams's theorem revisited (2001) (13)
Hamiltonicity of random subgraphs of the hypercube (2020) (13)
Four‐cycles in graphs without a given even cycle (2005) (13)
A bandwidth theorem for approximate decompositions (2017) (12)
Minimalist designs (2018) (12)
Arbitrary Orientations of Hamilton Cycles in Digraphs (2014) (11)
Multicoloured Hamilton cycles and perfect matchings in pseudo-random graphs (2004) (11)
Optimal covers with Hamilton cycles in random graphs (2012) (11)
Extremal connectivity for topological cliques in bipartite graphs (2006) (11)
Perfect packings with complete graphs minus an edge (2006) (11)
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)
On the Random Greedy F-Free Hypergraph Process (2015) (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)
A universal planar graph under the minor relation (1999) (7)
Euler Tours in Hypergraphs (2018) (7)
k-Ordered Hamilton cycles in digraphs (2007) (6)
Subdivisions of $K_{r+2}$ in Graphs of Average Degree at Least $r+\varepsilon$ and Large but Constant Girth (2004) (6)
A note on complete subdivisions in digraphs of large outdegree (2006) (6)
Path and cycle decompositions of dense graphs (2019) (6)
Resilient Degree Sequences with respect to Hamilton Cycles and Matchings in Random Graphs (2018) (5)
Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing (2018) (5)
Packings in Dense Regular Graphs (2005) (5)
Embedding cycles of given length in oriented graphs (2011) (4)
A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects (2022) (4)
Dirac’s theorem for random regular graphs (2019) (4)
Forbidding induced even cycles in a graph: Typical structure and counting (2015) (4)
A Characterization of Testable Hypergraph Properties (2017) (4)
Four-cycles in graphs without a given even cycle (2005) (3)
Counting Hamilton cycles in Dirac hypergraphs (2019) (3)
A domination algorithm for {0,1}‐instances of the travelling salesman problem (2014) (3)
A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree (2021) (2)
Matchings in 3-uniform hypergraphs of large minimum vertex degree (2011) (2)
Forcing a K r minor by high external connectivity (2002) (2)
Almost all optimally coloured complete graphs contain a rainbow Hamilton path (2020) (2)
Subdivisions of K r + 2 in graphs of average degree at least r + ε and large but constant girth (2002) (2)
Minor-universal planar graphs without accumulation points (2001) (1)
Cycles, minors and trees (2001) (1)
Forcing aKrminor by high external connectivity: FORCING AKrMINOR (2002) (1)
Forcing a Kr minor by high external connectivity (2002) (1)
Ramsey numbers of sparse hypergraphs (2007) (1)
Matchings and Hamilton cycles in hypergraphs (2005) (1)
University of Birmingham Bipartitions of Highly Connected Tournaments (2016) (0)
University of Birmingham Path and cycle decompositions of dense graphs (2020) (0)
University of Birmingham Counting Hamilton cycles in Dirac hypergraphs (2021) (0)
Problems for the Barbados Graph Theory Workshop 2017 (2017) (0)
Tuesday ( Including celebration of Tutte centenary ) (2017) (0)
Path decompositions of tournaments (2020) (0)
K_l−-factors in graphs (2020) (0)
Short cycles in oriented graphs (2009) (0)
University of Birmingham Euler tours in hypergraphs (2020) (0)
Euler Tours in Hypergraphs (2020) (0)
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths (2015) (0)
Semester Report Ss04 of Daniela Kühn (2003) (0)
Resilience with respect to Hamiltonicity in random graphs (2019) (0)
$K_{\ell}^{-}$-factors in graphs (2005) (0)
University of Birmingham Decompositions into isomorphic rainbow spanning trees (2020) (0)
Problems for the Barbados Graph Theory Workshop (2018) (0)
University of Birmingham Resolution of the Oberwolfach problem (2021) (0)
K − `-factors in graphs (2005) (0)
Optimal covers with Hamilton cycles in random graphs (2014) (0)
List Edge-colouring Graphs with Restricted Odd Cycles (2017) (0)
Hypergraph regularity and random sampling (2021) (0)
On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems (2020) (0)
University of Birmingham Arbitrary orientations of Hamilton cycles in digraphs (2015) (0)
-factors in graphs (2018) (0)
A minimum degree condition forcing a digraph to be k-linked (2007) (0)
Degree sequences forcing Hamilton cycles in directed graphs (2009) (0)
University of Birmingham Fractional clique decompositions of dense graphs (2017) (0)
A TOURNAMENT VERSION OF THE LOVÁSZ PATH REMOVAL CONJECTURE (2014) (0)
University of Birmingham A domination algorithm for {0,1}-instances of the travelling salesman problem (2015) (0)
University of Birmingham On a conjecture of Erds on locally sparse Steiner triple systems (2019) (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 Daniela Kühn

en.wikipedia.org

What Schools Are Affiliated With Daniela Kühn?

Daniela Kühn is affiliated with the following schools: