Daniela Kuhn

Citeras av

	Alla	Sedan 2019
Citat	4149	1969
h-index	36	26
i10-index	92	63

440

220

110

330

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420 36 47 39 63 64 119 109 153 104 219 212 184 244 253 201 296 292 351 409 434 179

Offentlig åtkomst

Visa alla

46 artiklar

0 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Deryk OsthusUniversity of BirminghamVerifierad e-postadress på bham.ac.uk
Allan LoUniversity of BirminghamVerifierad e-postadress på bham.ac.uk
Stefan GlockUniversität PassauVerifierad e-postadress på uni-passau.de
Andrew TreglownUniversity of BirminghamVerifierad e-postadress på bham.ac.uk
Jaehoon KimKAISTVerifierad e-postadress på kaist.ac.kr
Richard MycroftLecturer in Mathematics, University of BirminghamVerifierad e-postadress på bham.ac.uk
Nikolaos FountoulakisReader in Mathematics, University of BirminghamVerifierad e-postadress på bham.ac.uk
Ben BarberUniversity of ManchesterVerifierad e-postadress på manchester.ac.uk
Richard MontgomeryUniversity of BirminghamVerifierad e-postadress på bham.ac.uk
John LapinskasResearch Assistant in Computer Science, Oxford UniversityVerifierad e-postadress på cs.ox.ac.uk
Viresh PatelAssistant Professor, Mathematics, University of AmsterdamVerifierad e-postadress på uva.nl
Anusch TarazProfessor der Mathematik, TU HamburgVerifierad e-postadress på tuhh.de
Mykhaylo TyomkynCharles University, PragueVerifierad e-postadress på kam.mff.cuni.cz
Andrey KupavskiiMoscow Institute of Physics and TechnologyVerifierad e-postadress på mipt.ru
Louis DeBiasioMiami UniversityVerifierad e-postadress på miamioh.edu
Theodore MollaUniversity of South FloridaVerifierad e-postadress på usf.edu
Dan HefetzAriel UniversityVerifierad e-postadress på ariel.ac.il

Följ

Daniela Kuhn

University of Birmingham

Verifierad e-postadress på bham.ac.uk - Startsida

Graph Theory Combinatorics Discrete Mathematics


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Embedding large subgraphs into dense graphs D Kühn, D Osthus arXiv preprint arXiv:0901.3541, 2009	168	2009
The minimum degree threshold for perfect graph packings D Kühn, D Osthus Combinatorica 29 (1), 65-107, 2009	152	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	147*	2016
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	139	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	135	2013
Graph-theoretical versus topological ends of graphs R Diestel, D Kühn Journal of Combinatorial Theory, Series B 87 (1), 197-206, 2003	124	2003
On infinite cycles I R Diestel, D Kuhn Combinatorica 24 (1), 69–89, 2004	115*	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	99*	2016
Hamilton ℓ-cycles in uniform hypergraphs D Kühn, R Mycroft, D Osthus Journal of Combinatorial Theory, Series A 117 (7), 910-927, 2010	93	2010
Matchings in hypergraphs of large minimum degree D Kühn, D Osthus Journal of Graph Theory 51 (4), 269-280, 2006	91	2006
Edge‐disjoint Hamilton cycles in random graphs F Knox, D Kühn, D Osthus Random Structures & Algorithms 46 (3), 397-445, 2015	86	2015
Matchings in 3-uniform hypergraphs D Kühn, D Osthus, A Treglown Journal of Combinatorial Theory, Series B 103 (2), 291-305, 2013	85	2013
Topological paths, cycles and spanning trees in infinite graphs R Diestel, D Kühn European Journal of Combinatorics 25 (6), 835-862, 2004	83	2004
Hamilton cycles in graphs and hypergraphs: an extremal perspective D Kühn, D Osthus arXiv preprint arXiv:1402.4268, 2014	82	2014
Loose Hamilton cycles in hypergraphs P Keevash, D Kühn, R Mycroft, D Osthus Discrete Mathematics 311 (7), 544-559, 2011	82	2011
On infinite cycles II R Diestel, D Kühn Combinatorica 24, 91-116, 2004	82	2004
A survey on Hamilton cycles in directed graphs D Kühn, D Osthus European Journal of Combinatorics 33 (5), 750-766, 2012	81	2012
Edge-decompositions of graphs with high minimum degree B Barber, D Kühn, A Lo, D Osthus Advances in Mathematics 288, 337-385, 2016	80	2016
Hamiltonian degree sequences in digraphs D Kühn, D Osthus, A Treglown Journal of Combinatorial Theory, Series B 100 (4), 367-380, 2010	71	2010
Induced Subdivisions In K_s,s-Free Graphs of Large Average Degree D Kuhn, D Osthus Combinatorica 24 (2), 287-304, 2004	71	2004

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare