Embedding large subgraphs into dense graphs D Kühn, D Osthus
arXiv preprint arXiv:0901.3541, 2009
158 2009 Popularity based random graph models leading to a scale-free degree sequence PG Buckley, D Osthus
Discrete Mathematics 282 (1-3), 53-68, 2004
145 2004 The minimum degree threshold for perfect graph packings D Kühn, D Osthus
Combinatorica 29 (1), 65-107, 2009
137 2009 Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree D Kühn, D Osthus
Journal of Combinatorial Theory, Series B 96 (6), 767-821, 2006
130 2006 The existence of designs via iterative absorption: hypergraph S Glock, D Kühn, A Lo, D Osthus
arXiv preprint arXiv:1611.06827, 2016
115 2016 Hamilton decompositions of regular expanders: a proof of Kelly’s conjecture for large tournaments D Kühn, D Osthus
Advances in Mathematics 237, 62-146, 2013
111 2013 Matchings in hypergraphs of large minimum degree D Kühn, D Osthus
Journal of Graph Theory 51 (4), 269-280, 2006
86 2006 Matchings in 3-uniform hypergraphs D Kühn, D Osthus, A Treglown
Journal of Combinatorial Theory, Series B 103 (2), 291-305, 2013
84 2013 Hamilton ℓ-cycles in uniform hypergraphs D Kühn, R Mycroft, D Osthus
Journal of Combinatorial Theory, Series A 117 (7), 910-927, 2010
84 2010 Proof of the 1-factorization and Hamilton decomposition conjectures B Csaba, D Kühn, A Lo, D Osthus, A Treglown
American Mathematical Soc., 2016
78 2016 Edge‐disjoint Hamilton cycles in random graphs F Knox, D Kühn, D Osthus
Random Structures & Algorithms 46 (3), 397-445, 2015
75 2015 Loose Hamilton cycles in hypergraphs P Keevash, D Kühn, R Mycroft, D Osthus
Discrete Mathematics 311 (7), 544-559, 2011
73 2011 Hamilton cycles in graphs and hypergraphs: an extremal perspective D Kühn, D Osthus
arXiv preprint arXiv:1402.4268, 2014
68 2014 Edge-decompositions of graphs with high minimum degree B Barber, D Kühn, A Lo, D Osthus
Advances in Mathematics 288, 337-385, 2016
67 2016 A survey on Hamilton cycles in directed graphs D Kühn, D Osthus
European Journal of Combinatorics 33 (5), 750-766, 2012
67 2012 Hamilton decompositions of regular expanders: applications D Kühn, D Osthus
Journal of Combinatorial Theory, Series B 104, 1-27, 2014
64 2014 Hamiltonian degree sequences in digraphs D Kühn, D Osthus, A Treglown
Journal of Combinatorial Theory, Series B 100 (4), 367-380, 2010
63 2010 On random planar graphs, the number of planar graphs and their triangulations D Osthus, HJ Prömel, A Taraz
Journal of Combinatorial Theory, Series B 88 (1), 119-134, 2003
63 2003 Random maximal H ‐free graphs* D Osthus, A Taraz
Random Structures & Algorithms 18 (1), 61-82, 2001
61 2001 Embeddings and Ramsey numbers of sparse κ -uniform hypergraphs O Cooley, N Fountoulakis, D Kühn, D Osthus
Combinatorica 29, 263-297, 2009
57 2009 
Daniela KuhnUniversity of BirminghamE-mail megerősítve itt: bham.ac.uk
