Daniela Kuehn · Publications

Preprints submitted:

Preprints accepted:

Papers:
2009

Minors in random regular graphs (with Nikolaos Fountoulakis and Deryk Osthus, Random Structures and Algorithms 35 (2009), 444-463)
An Ore-type theorem for perfect packings in graphs (with Deryk Osthus and Andrew Treglown, SIAM Journal Discrete Mathematics 23 (2009), 1335-1355)
Embedding large subgraphs into dense graphs (with Deryk Osthus, Surveys in Combinatorics (editors S. Huczynka, J. Mitchell, C. Roney-Dougal), London Math. Soc. Lecture Notes 365, Cambridge University Press, 2009, 137-167)
Embeddings and Ramsey numbers of sparse k-uniform hypergraphs (with Oliver Cooley, Nikolaos Fountoulakis and Deryk Osthus, Combinatorica 29 (2009), 263-297)
The minimum degree threshold for perfect graph packings (with Deryk Osthus, Combinatorica 29 (2009), 65-107)
An exact minimum degree condition for Hamilton cycles in oriented graphs (with Peter Keevash and Deryk Osthus, Journal London Mathematical Society 79 (2009), 144-166)

2008

k-ordered Hamilton cycles in digraphs (with Deryk Osthus and Andrew Young, J. Combinatorial Theory Series B 98 (2008) 1165-1180)
A Dirac type result for oriented graphs (with Luke Kelly and Deryk Osthus, Combinatorics, Probability and Computing 17 (2008), 689-709)
The order of the largest complete minor in a random graph (with Nikolaos Fountoulakis and Deryk Osthus, Random Structures and Algorithms 33 (2008), 127-141)
Linkedness and ordered cycles in digraphs (with Deryk Osthus, Combinatorics, Probability and Computing 17 (2008), 411-422)
3-uniform hypergraphs of bounded degree have linear Ramsey numbers (with Oliver Cooley, Nikolaos Fountoulakis and Deryk Osthus, J. Combinatorial Theory Series B 98 (2008), 484-505)
A note on complete subdivisions in digraphs of large outdegree (with Deryk Osthus and Andrew Young, J. Graph Theory 57 (2008), 1-6)

2007

Perfect packings with complete graphs minus an edge (with Oliver Cooley and Deryk Osthus, European J. Combinatorics 28 (2007), 2143-2155)
Maximizing several cuts simultaneously (with Deryk Osthus, Combinatorics, Probability and Computing 16 (2007), 277-283)

2006

Loose Hamilton cycles in 3-uniform hypergraphs of large minimum degree (with Deryk Osthus, J. Combinatorial Theory Series B 96 (2006), 767-821)
Multicoloured Hamilton cycles and perfect matchings in pseudo-random graphs (with Deryk Osthus, SIAM J. Discrete Mathematics 20 (2006), 273-286)
Improved bounds for topological cliques in graphs of large girth (with Deryk Osthus, SIAM J. Discrete Mathematics 20 (2006), 62-78)
Matchings in hypergraphs of large minimum degree (with Deryk Osthus, J. Graph Theory 51 (2006), 269-280)
Extremal connectivity for topological cliques in bipartite graphs (with Deryk Osthus, J. Combinatorial Theory Series B 96 (2006), 73-99)
Critical chromatic number and the complexity of perfect packings in graphs (with Deryk Osthus, Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms 2006 (SODA), 851-859)

2005

Large planar subgraphs in dense graphs (with Deryk Osthus and Anusch Taraz, J. Combinatorial Theory Series B 95 (2005), 263-282)
Spanning triangulations in graphs (with Deryk Osthus, J. Graph Theory 49 (2005), 205-233)
Graph minor hierarchies (with Reinhard Diestel, Discrete Applied Mathematics 145 (2005), 167-182)
Packings in dense regular graphs (with Deryk Osthus, Combinatorics, Probability and Computing 14 (2005), 325-337)
Four-cycles in graphs without a given even cycle (with Deryk Osthus, J. Graph Theory 48 (2005), 147-156)
Forcing unbalanced complete bipartite minors (with Deryk Osthus, European J. Combinatorics 26 (2005), 75-81)

2004

Complete minors in K_s,s-free graphs (with Deryk Osthus, Combinatorica 25 (2004), 49-64)
Topological paths, cycles and spanning trees in infinite graphs (with Reinhard Diestel, European J. Combinatorics 25 (2004), 835-862)
Induced subdivisions in K_s,s -free graphs of large average degree (with Deryk Osthus, Combinatorica 24 (2004), 287-304)
Every graph of sufficiently large average degree contains a C₄-free graph of large average degree (with Deryk Osthus, Combinatorica 24 (2004), 155-162)
On infinite cycles II (with Reinhard Diestel, Combinatorica 24 (2004), 91-116)
On infinite cycles I (with Reinhard Diestel, Combinatorica 24 (2004), 69-89)
Subdivisions of K_r+2 in graphs of average degree at least r+epsilon and large but constant girth (with Deryk Osthus, Combinatorics, Probability and Computing 13 (2004), 361-371)
Large topological cliques in graphs without a 4-cycle (with Deryk Osthus, Combinatorics, Probability and Computing 13 (2004), 93-102)

2003

1999-2002

Topological minors in graphs of large girth (with Deryk Osthus, J. Combinatorial Theory Series B 86 (2002), 364-380)
Forcing a K_r minor by high external connectivity (J. Graph Theory, 39 (2002), 241-264)
On well-quasi-ordering infinite trees - Nash-Williams's theorem revisited (Math. Proc. Camb. Phil. Soc. 130 (2001), 401-408)
Minor-universal planar graphs without accumulation points (J. Graph Theory 36 (2001), 1-7)
A universal planar graph under the minor relation (with Reinhard Diestel, J. Graph Theory 32 (1999), 191-206)