H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 31 Citations 3,489 122 World Ranking 8078 National Ranking 473
Mathematics D-index 31 Citations 3,567 125 World Ranking 2024 National Ranking 130

Overview

What is she best known for?

The fields of study she is best known for:

  • Combinatorics
  • Discrete mathematics
  • Graph theory

Daniela Kühn spends much of her time researching Combinatorics, Discrete mathematics, Graph, Conjecture and Hamiltonian path. Her study involves Hypergraph, Degree, Digraph, Disjoint sets and Tournament, a branch of Combinatorics. Daniela Kühn combines subjects such as Travelling salesman problem and Undirected graph with her study of Degree.

In her study, Range is strongly linked to Matching, which falls under the umbrella field of Discrete mathematics. Her work carried out in the field of Graph brings together such families of science as Topology and Spanning tree. Her Perfect graph research is multidisciplinary, relying on both Tutte theorem, Strong perfect graph theorem and Perfect graph theorem.

Her most cited work include:

  • The minimum degree threshold for perfect graph packings (141 citations)
  • Embedding large subgraphs into dense graphs (141 citations)
  • Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (112 citations)

What are the main themes of her work throughout her whole career to date?

Daniela Kühn mostly deals with Combinatorics, Discrete mathematics, Conjecture, Graph and Hypergraph. Her study in Hamiltonian path, Degree, Random graph, Tournament and Digraph is carried out as part of her studies in Combinatorics. Her research combines Topology and Discrete mathematics.

Her Conjecture research is multidisciplinary, incorporating perspectives in Sequence, Bounded function and Vertex. Many of her research projects under Graph are closely connected to Subdivision with Subdivision, tying the diverse disciplines of science together. Her Hypergraph research incorporates elements of Matching, Edge and Divisibility rule.

She most often published in these fields:

  • Combinatorics (97.37%)
  • Discrete mathematics (49.47%)
  • Conjecture (45.26%)

What were the highlights of her more recent work (between 2018-2021)?

  • Combinatorics (97.37%)
  • Conjecture (45.26%)
  • Graph (41.05%)

In recent papers she was focusing on the following fields of study:

Daniela Kühn spends much of her time researching Combinatorics, Conjecture, Graph, Hypergraph and Degree. Her research on Combinatorics frequently links to adjacent areas such as Bounded function. The concepts of her Conjecture study are interwoven with issues in Asymptotically optimal algorithm, Tournament, Path and Vertex.

Her study in the fields of Bipartite graph under the domain of Graph overlaps with other disciplines such as Hamiltonian, Threshold probability and High probability. Her Hypergraph research includes elements of Edge coloring and Graph. Her Divisibility rule study necessitates a more in-depth grasp of Discrete mathematics.

Between 2018 and 2021, her most popular works were:

  • Optimal packings of bounded degree trees (25 citations)
  • A bandwidth theorem for approximate decompositions (11 citations)
  • On the decomposition threshold of a given graph (11 citations)

In her most recent research, the most cited papers focused on:

  • Combinatorics
  • Graph theory
  • Discrete mathematics

Her main research concerns Combinatorics, Graph, Conjecture, Bounded function and Rainbow. Her work on Combinatorics deals in particular with Bipartite graph, Existential quantification, Graph, Connectivity and Vertex. Her research integrates issues of Separable space, Sublinear function, Infimum and supremum and Vertex in her study of Bipartite graph.

Her Existential quantification study combines topics in areas such as Steiner system and Girth. Her studies deal with areas such as Sequence and If and only if as well as Conjecture. Her Bounded function study combines topics from a wide range of disciplines, such as Tree, Lemma and Degree.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Embedding large subgraphs into dense graphs

Daniela Kühn;Deryk Osthus.
arXiv: Combinatorics (2009)

209 Citations

The minimum degree threshold for perfect graph packings

Daniela Kühn;Deryk Osthus.
Combinatorica (2009)

141 Citations

Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree

Daniela Kühn;Deryk Osthus.
Journal of Combinatorial Theory, Series B (2006)

129 Citations

On Infinite Cycles I

Reinhard Diestel;Daniela Kühn.
Combinatorica (2004)

102 Citations

Graph-theoretical versus topological ends of graphs

Reinhard Diestel;Daniela Kühn.
Journal of Combinatorial Theory, Series B (2003)

102 Citations

Hamilton decompositions of regular expanders: A proof of Kelly’s conjecture for large tournaments

Daniela Kühn;Deryk Osthus.
Advances in Mathematics (2013)

101 Citations

Matchings in hypergraphs of large minimum degree

Daniela Kühn;Deryk Osthus.
Journal of Graph Theory (2006)

81 Citations

Topological paths, cycles and spanning trees in infinite graphs

Reinhard Diestel;Daniela Kühn.
European Journal of Combinatorics (2004)

80 Citations

Hamilton ℓ-cycles in uniform hypergraphs

Daniela Kühn;Richard Mycroft;Deryk Osthus.
Journal of Combinatorial Theory, Series A (2010)

77 Citations

Edge-disjoint Hamilton cycles in graphs

Demetres Christofides;Daniela KüHn;Deryk Osthus.
Journal of Combinatorial Theory, Series B (2012)

76 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Daniela Kühn

Benny Sudakov

Benny Sudakov

ETH Zurich

Publications: 63

Michael Krivelevich

Michael Krivelevich

Tel Aviv University

Publications: 49

David R. Wood

David R. Wood

Monash University

Publications: 19

Jacob Fox

Jacob Fox

Stanford University

Publications: 18

Andrzej Ruciński

Andrzej Ruciński

Adam Mickiewicz University in Poznań

Publications: 16

József Balogh

József Balogh

University of Illinois at Urbana-Champaign

Publications: 16

Alan Frieze

Alan Frieze

Carnegie Mellon University

Publications: 16

Endre Szemerédi

Endre Szemerédi

Alfréd Rényi Institute of Mathematics

Publications: 14

Yoshiharu Kohayakawa

Yoshiharu Kohayakawa

Universidade de São Paulo

Publications: 11

Vojtěch Rödl

Vojtěch Rödl

Emory University

Publications: 9

Anders Yeo

Anders Yeo

University of Johannesburg

Publications: 8

Raphael Yuster

Raphael Yuster

University of Haifa

Publications: 8

Bruce Reed

Bruce Reed

McGill University

Publications: 8

Angelika Steger

Angelika Steger

ETH Zurich

Publications: 7

János Pach

János Pach

Alfréd Rényi Institute of Mathematics

Publications: 6

Carsten Thomassen

Carsten Thomassen

Technical University of Denmark

Publications: 6

Something went wrong. Please try again later.