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.
