Detail page

Knowledge Web

Person

Daniela Kühn (1973-)

Mathematikerin

Name	Daniela Kühn
Time	1973- (Date of birth and death)
Place	Deutschland
Academic degree	Prof. Dr. Dr. (Diss. Fachbereich Mathematik, Univ. Hamburg) (2001)
Profession	Mathematikerin (characteristic profession)
Variant	D. Kühn
Related	University of Birmingham (Mason Professor of Mathematics) (2010-)
Record type	Person
GND-Identifier	123412005
Record ID	123412005
Involved in show all Large Topological Cliques in Graphs Without a 4-Cycle Euler Tours in Hypergraphs Complete Minors In K s,s -Free Graphs Induced Subdivisions In K s,s -Free Graphs of Large Average Degree Every Graph of Sufficiently Large Average Degree Contains a C 4-Free Subgraph of Large Average Degree On Infinite Cycles II On Infinite Cycles I A universal planar graph under the minor relation Complete minors in Ks,s-free graphs Graphs not containing a given tree have almost linear Ramsey numbers Large topological cliques in graphs without a 4-cycle Minors in graphs of large girth On infinite cycles 1. On infinite cycles 2. On the cofinality of infinite partially ordered sets : factoring a poset into lean essential subsets Subdivisions of Kr+2 in graphs of average degree at least r + ε and large but constant girth Topological minors in graphs of large girth Cycles, minors and trees Cycles, minors and trees Every graph of sufficiently large average degree contains a C4-free subgraph of large average degree Forcing a Kr-minor by high external connectivity Graph minor hierarchies & decomposition duality Graph-theoretical versus topological ends of graphs Induced cycles in Ks,s-free graphs of large average degree Induced subdivisions in Ks,s-free graphs of large average degree Partitions of graphs with high minimum degree or connectivity Topological paths, cycles and spanning trees in infinite graphs On infinite cycles

Please note

The beta version does not yet contain all functions and information of the DNB portal catalogue. If you are missing information or want to order a medium, please visit the page in the DNB portal catalogue via the following link:

Katalog der Deutschen Nationalbibliothek

Daniela Kühn (1973-)

Large Topological Cliques in Graphs Without a 4-Cycle

Euler Tours in Hypergraphs

Complete Minors In K s,s -Free Graphs

Induced Subdivisions In K s,s -Free Graphs of Large Average Degree

Every Graph of Sufficiently Large Average Degree Contains a C 4-Free Subgraph of Large Average Degree

On Infinite Cycles II

On Infinite Cycles I

A universal planar graph under the minor relation

Complete minors in Ks,s-free graphs

Graphs not containing a given tree have almost linear Ramsey numbers

Large topological cliques in graphs without a 4-cycle

Minors in graphs of large girth

On infinite cycles

On infinite cycles

On the cofinality of infinite partially ordered sets : factoring a poset into lean essential subsets

Subdivisions of Kr+2 in graphs of average degree at least r + ε and large but constant girth

Topological minors in graphs of large girth

Cycles, minors and trees

Cycles, minors and trees

Every graph of sufficiently large average degree contains a C4-free subgraph of large average degree

Forcing a Kr-minor by high external connectivity

Graph minor hierarchies & decomposition duality

Graph-theoretical versus topological ends of graphs

Induced cycles in Ks,s-free graphs of large average degree

Induced subdivisions in Ks,s-free graphs of large average degree

Partitions of graphs with high minimum degree or connectivity

Topological paths, cycles and spanning trees in infinite graphs

On infinite cycles