Daniela Kühn

	2012
50		Daniela Kühn, Deryk Osthus: Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments CoRR abs/1202.6219: (2012)
49		Daniela Kühn, Deryk Osthus: A survey on Hamilton cycles in directed graphs. Eur. J. Comb. 33(5): 750-766 (2012)
48		Fiachra Knox, Daniela Kühn, Deryk Osthus: Approximate Hamilton decompositions of random graphs. Random Struct. Algorithms 40(2): 133-149 (2012)
	2011
47		Peter Keevash, Daniela Kühn, Richard Mycroft, Deryk Osthus: Loose Hamilton cycles in hypergraphs. Discrete Mathematics 311(7): 544-559 (2011)
46		Daniela Kühn, Richard Mycroft, Deryk Osthus: An approximate version of Sumnerʼs universal tournament conjecture. J. Comb. Theory, Ser. B 101(6): 415-447 (2011)
	2010
45		Daniela Kühn, Richard Mycroft, Deryk Osthus: Hamilton l-cycles in uniform hypergraphs. J. Comb. Theory, Ser. A 117(7): 910-927 (2010)
44		Luke Kelly, Daniela Kühn, Deryk Osthus: Cycles of given length in oriented graphs. J. Comb. Theory, Ser. B 100(3): 251-264 (2010)
43		Daniela Kühn, Deryk Osthus, Andrew Treglown: Hamiltonian degree sequences in digraphs. J. Comb. Theory, Ser. B 100(4): 367-380 (2010)
42		Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus: A Semiexact Degree Condition for Hamilton Cycles in Digraphs. SIAM J. Discrete Math. 24(3): 709-756 (2010)
	2009
41		Daniela Kühn, Deryk Osthus: The minimum degree threshold for perfect graph packings. Combinatorica 29(1): 65-107 (2009)
40		Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus: Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs. Combinatorica 29(3): 263-297 (2009)
39		Daniela Kühn, Deryk Osthus, Andrew Treglown: Degree sequences forcing Hamilton cycles in directed graphs. Electronic Notes in Discrete Mathematics 34: 347-351 (2009)
38		Deryk Osthus, Luke Kelly, Daniela Kühn: Short cycles in oriented graphs. Electronic Notes in Discrete Mathematics 34: 369-373 (2009)
37		Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus: Minors in random regular graphs. Random Struct. Algorithms 35(4): 444-463 (2009)
36		Daniela Kühn, Deryk Osthus, Andrew Treglown: An Ore-type Theorem for Perfect Packings in Graphs. SIAM J. Discrete Math. 23(3): 1335-1355 (2009)
	2008
35		Daniela Kühn, Deryk Osthus: Linkedness and Ordered Cycles in Digraphs. Combinatorics, Probability & Computing 17(3): 411-422 (2008)
34		Luke Kelly, Daniela Kühn, Deryk Osthus: A Dirac-Type Result on Hamilton Cycles in Oriented Graphs. Combinatorics, Probability & Computing 17(5): 689-709 (2008)
33		Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus: 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers. J. Comb. Theory, Ser. B 98(3): 484-505 (2008)
32		Daniela Kühn, Deryk Osthus, Andrew Young: k-Ordered Hamilton cycles in digraphs. J. Comb. Theory, Ser. B 98(6): 1165-1180 (2008)
31		Daniela Kühn, Deryk Osthus, Andrew Young: A note on complete subdivisions in digraphs of large outdegree. Journal of Graph Theory 57(1): 1-6 (2008)
30		Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus: The order of the largest complete minor in a random graph. Random Struct. Algorithms 33(2): 127-141 (2008)
	2007
29		Daniela Kühn, Deryk Osthus: Maximizing Several Cuts Simultaneously. Combinatorics, Probability & Computing 16(2): 277-283 (2007)
28		Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus: The order of the largest complete minor in a random graph. Electronic Notes in Discrete Mathematics 29: 141-146 (2007)
27		Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus: Ramsey numbers of sparse hypergraphs. Electronic Notes in Discrete Mathematics 29: 29-33 (2007)
26		Deryk Osthus, Daniela Kühn: A minimum degree condition forcing a digraph to be k-linked. Electronic Notes in Discrete Mathematics 29: 35-39 (2007)
25		Oliver Cooley, Daniela Kühn, Deryk Osthus: Perfect packings with complete graphs minus an edge. Eur. J. Comb. 28(8): 2143-2155 (2007)
	2006
24		Daniela Kühn, Deryk Osthus: Critical chromatic number and the complexity of perfect packings in graphs. SODA 2006: 851-859
23		Daniela Kühn, Deryk Osthus: Extremal connectivity for topological cliques in bipartite graphs. J. Comb. Theory, Ser. B 96(1): 73-99 (2006)
22		Daniela Kühn, Deryk Osthus: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Comb. Theory, Ser. B 96(6): 767-821 (2006)
21		Daniela Kühn, Deryk Osthus: Matchings in hypergraphs of large minimum degree. Journal of Graph Theory 51(4): 269-280 (2006)
20		Daniela Kühn, Deryk Osthus: Improved Bounds for Topological Cliques in Graphs of Large Girth. SIAM J. Discrete Math. 20(1): 62-78 (2006)
19		Daniela Kühn, Deryk Osthus: Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs. SIAM J. Discrete Math. 20(2): 273-286 (2006)
	2005
18		Daniela Kühn, Deryk Osthus: Packings in Dense Regular Graphs. Combinatorics, Probability & Computing 14(3): 325-337 (2005)
17		Reinhard Diestel, Daniela Kühn: Graph minor hierarchies. Discrete Applied Mathematics 145(2): 167-182 (2005)
16		Daniela Kühn, Deryk Osthus: Forcing unbalanced complete bipartite minors. Eur. J. Comb. 26(1): 75-81 (2005)
15		Daniela Kühn, Deryk Osthus, Anusch Taraz: Large planar subgraphs in dense graphs. J. Comb. Theory, Ser. B 95(2): 263-282 (2005)
14		Daniela Kühn, Deryk Osthus: Four-cycles in graphs without a given even cycle. Journal of Graph Theory 48(2): 147-156 (2005)
13		Daniela Kühn, Deryk Osthus: Spanning triangulations in graphs. Journal of Graph Theory 49(3): 205-233 (2005)
	2004
12		Daniela Kühn, Deryk Osthus: Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree. Combinatorica 24(1): 155-162 (2004)
11		Reinhard Diestel, Daniela Kühn: On Infinite Cycles I. Combinatorica 24(1): 69-89 (2004)
10		Reinhard Diestel, Daniela Kühn: On Infinite Cycles II. Combinatorica 24(1): 91-116 (2004)
9		Daniela Kühn, Deryk Osthus: Induced Subdivisions In Ks, s-Free Graphs of Large Average Degree. Combinatorica 24(2): 287-304 (2004)
8		Daniela Kühn, Deryk Osthus: Complete Minors In Ks, s-Free Graphs. Combinatorica 25(1): 49-64 (2004)
7		Daniela Kühn, Deryk Osthus: Large Topological Cliques in Graphs Without a 4-Cycle. Combinatorics, Probability & Computing 13(1): 93-102 (2004)
6		Daniela Kühn, Deryk Osthus: Subdivisions of Kr+2 in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth. Combinatorics, Probability & Computing 13(3): 361-371 (2004)
5		Reinhard Diestel, Daniela Kühn: Topological paths, cycles and spanning trees in infinite graphs. Eur. J. Comb. 25(6): 835-862 (2004)
	2003
4		Reinhard Diestel, Daniela Kühn: Graph-theoretical versus topological ends of graphs. J. Comb. Theory, Ser. B 87(1): 197-206 (2003)
3		Daniela Kühn, Deryk Osthus: Partitions of graphs with high minimum degree or connectivity. J. Comb. Theory, Ser. B 88(1): 29-43 (2003)
2		Daniela Kühn, Deryk Osthus: Minors in graphs of large girth. Random Struct. Algorithms 22(2): 213-225 (2003)
	2002
1		Daniela Kühn, Deryk Osthus: Topological Minors in Graphs of Large Girth. J. Comb. Theory, Ser. B 86(2): 364-380 (2002)

Coauthor Index

1	Demetres Christofides	[42]
2	Oliver Cooley	[25] [27] [33] [40]
3	Reinhard Diestel	[4] [5] [10] [11] [17]
4	Nikolaos Fountoulakis	[27] [28] [30] [33] [37] [40]
5	Peter Keevash	[42] [47]
6	Luke Kelly	[34] [38] [44]
7	Fiachra Knox	[48]
8	Richard Mycroft	[45] [46] [47]
9	Deryk Osthus	[1] [2] [3] [6] [7] [8] [9] [12] [13] [14] [15] [16] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50]
10	Anusch Taraz	[15]
11	Andrew Treglown	[36] [39] [43]
12	Andrew Young	[31] [32]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page