Daniela Kuhn

Cited by

	All	Since 2019
Citations	4383	2162
h-index	37	27
i10-index	96	67

440

220

110

330

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420 35 47 39 63 64 122 109 155 104 222 221 194 238 256 202 296 292 345 363 419 436

Public access

View all

47 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Deryk OsthusUniversity of BirminghamVerified email at bham.ac.uk
Allan LoUniversity of BirminghamVerified email at bham.ac.uk
Stefan GlockUniversität PassauVerified email at uni-passau.de
Andrew TreglownUniversity of BirminghamVerified email at bham.ac.uk
Jaehoon KimKAISTVerified email at kaist.ac.kr
Richard MycroftLecturer in Mathematics, University of BirminghamVerified email at bham.ac.uk
Nikolaos FountoulakisReader in Mathematics, University of BirminghamVerified email at bham.ac.uk
Ben BarberRiverlaneVerified email at riverlane.com
Richard MontgomeryUniversity of BirminghamVerified email at bham.ac.uk
John LapinskasLecturer in Computer Science, University of BristolVerified email at bristol.ac.uk
Viresh PatelAssistant Professor, Mathematics, University of AmsterdamVerified email at uva.nl
Anusch TarazProfessor der Mathematik, TU HamburgVerified email at tuhh.de
Mykhaylo TyomkynCharles University, PragueVerified email at kam.mff.cuni.cz
Andrey KupavskiiMoscow Institute of Physics and TechnologyVerified email at mipt.ru
Louis DeBiasioMiami UniversityVerified email at miamioh.edu
Theodore MollaUniversity of South FloridaVerified email at usf.edu
Dan HefetzAriel UniversityVerified email at ariel.ac.il

Daniela Kuhn

University of Birmingham

Verified email at bham.ac.uk - Homepage

Graph Theory Combinatorics Discrete Mathematics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Embedding large subgraphs into dense graphs D Kühn, D Osthus arXiv preprint arXiv:0901.3541, 2009	176	2009
The existence of designs via iterative absorption S Glock, D Kühn, A Lo, D Osthus arXiv preprint arXiv:1611.06827, 3120-3122, 2016	163*	2016
The minimum degree threshold for perfect graph packings D Kühn, D Osthus Combinatorica 29 (1), 65-107, 2009	163	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	148	2006
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	141	2013
Graph-theoretical versus topological ends of graphs R Diestel, D Kühn Journal of Combinatorial Theory, Series B 87 (1), 197-206, 2003	126	2003
On infinite cycles I R Diestel, D Kuhn Combinatorica 24 (1), 69–89, 2004	116*	2004
Proof of the 1-factorization and Hamilton decomposition conjectures B Csaba, D Kühn, A Lo, D Osthus, A Treglown American Mathematical Society 244 (1154), 2016	106*	2016
Hamilton ℓ-cycles in uniform hypergraphs D Kühn, R Mycroft, D Osthus Journal of Combinatorial Theory, Series A 117 (7), 910-927, 2010	100	2010
Matchings in hypergraphs of large minimum degree D Kühn, D Osthus Journal of Graph Theory 51 (4), 269-280, 2006	95	2006
Matchings in 3-uniform hypergraphs D Kühn, D Osthus, A Treglown Journal of Combinatorial Theory, Series B 103 (2), 291-305, 2013	92	2013
A survey on Hamilton cycles in directed graphs D Kühn, D Osthus European Journal of Combinatorics 33 (5), 750-766, 2012	92	2012
Edge‐disjoint Hamilton cycles in random graphs F Knox, D Kühn, D Osthus Random Structures & Algorithms 46 (3), 397-445, 2015	89	2015
Loose Hamilton cycles in hypergraphs P Keevash, D Kühn, R Mycroft, D Osthus Discrete Mathematics 311 (7), 544-559, 2011	87	2011
Hamilton cycles in graphs and hypergraphs: an extremal perspective D Kühn, D Osthus arXiv preprint arXiv:1402.4268, 2014	86	2014
Topological paths, cycles and spanning trees in infinite graphs R Diestel, D Kühn European Journal of Combinatorics 25 (6), 835-862, 2004	86	2004
Edge-decompositions of graphs with high minimum degree B Barber, D Kühn, A Lo, D Osthus Advances in Mathematics 288, 337-385, 2016	82	2016
Induced Subdivisions In K_s,s-Free Graphs of Large Average Degree D Kuhn, D Osthus Combinatorica 24 (2), 287-304, 2004	78	2004
Hamilton decompositions of regular expanders: applications D Kühn, D Osthus Journal of Combinatorial Theory, Series B 104, 1-27, 2014	74	2014
Hamiltonian degree sequences in digraphs D Kühn, D Osthus, A Treglown Journal of Combinatorial Theory, Series B 100 (4), 367-380, 2010	73	2010

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors