Daniela Kuhn

Citata da

	Tutte	Dal 2020
Citazioni	4528	2060
Indice H	37	27
i10-index	97	67

580

290

145

435

2003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520 36 47 39 63 64 123 110 157 103 191 214 198 231 258 201 287 305 329 354 386 564 113

Accesso pubblico

Visualizza tutto

46 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Deryk OsthusUniversity of BirminghamEmail verificata su bham.ac.uk
Allan LoUniversity of BirminghamEmail verificata su bham.ac.uk
Stefan GlockUniversität PassauEmail verificata su uni-passau.de
Andrew TreglownUniversity of BirminghamEmail verificata su bham.ac.uk
Jaehoon KimKAISTEmail verificata su kaist.ac.kr
Richard MycroftLecturer in Mathematics, University of BirminghamEmail verificata su bham.ac.uk
Ben BarberRiverlaneEmail verificata su riverlane.com
Nikolaos FountoulakisReader in Mathematics, University of BirminghamEmail verificata su bham.ac.uk
Richard MontgomeryUniversity of WarwickEmail verificata su warwick.ac.uk
John LapinskasLecturer in Computer Science, University of BristolEmail verificata su bristol.ac.uk
Viresh PatelAssistant Professor, Mathematics, University of AmsterdamEmail verificata su uva.nl
Anusch TarazProfessor der Mathematik, TU HamburgEmail verificata su tuhh.de
Mykhaylo TyomkynCharles University, PragueEmail verificata su kam.mff.cuni.cz
Andrey KupavskiiMoscow Institute of Physics and TechnologyEmail verificata su mipt.ru
Louis DeBiasioMiami UniversityEmail verificata su miamioh.edu
Theodore MollaUniversity of South FloridaEmail verificata su usf.edu
Dan HefetzAriel UniversityEmail verificata su ariel.ac.il

Segui

Daniela Kuhn

University of Birmingham

Email verificata su bham.ac.uk - Home page

Graph Theory Combinatorics Discrete Mathematics


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Embedding large subgraphs into dense graphs D Kühn, D Osthus arXiv preprint arXiv:0901.3541, 2009	178	2009
The existence of designs via iterative absorption: hypergraph 𝐹-designs for arbitrary 𝐹 S Glock, D Kühn, A Lo, D Osthus American Mathematical Society 284 (1406), 2023	174*	2023
The minimum degree threshold for perfect graph packings D Kühn, D Osthus Combinatorica 29 (1), 65-107, 2009	166	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	153	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	145	2013
Graph-theoretical versus topological ends of graphs R Diestel, D Kühn Journal of Combinatorial Theory, Series B 87 (1), 197-206, 2003	128	2003
On infinite cycles I R Diestel, D Kuhn Combinatorica 24 (1), 69–89, 2004	117*	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	113	2016
Hamilton ℓ-cycles in uniform hypergraphs D Kühn, R Mycroft, D Osthus Journal of Combinatorial Theory, Series A 117 (7), 910-927, 2010	104	2010
Matchings in hypergraphs of large minimum degree D Kühn, D Osthus Journal of Graph Theory 51 (4), 269-280, 2006	97	2006
A survey on Hamilton cycles in directed graphs D Kühn, D Osthus European Journal of Combinatorics 33 (5), 750-766, 2012	95	2012
Matchings in 3-uniform hypergraphs D Kühn, D Osthus, A Treglown Journal of Combinatorial Theory, Series B 103 (2), 291-305, 2013	91	2013
Loose Hamilton cycles in hypergraphs P Keevash, D Kühn, R Mycroft, D Osthus Discrete Mathematics 311 (7), 544-559, 2011	91	2011
Edge‐disjoint Hamilton cycles in random graphs F Knox, D Kühn, D Osthus Random Structures & Algorithms 46 (3), 397-445, 2015	90	2015
Hamilton cycles in graphs and hypergraphs: an extremal perspective D Kühn, D Osthus arXiv preprint arXiv:1402.4268, 2014	89	2014
Topological paths, cycles and spanning trees in infinite graphs R Diestel, D Kühn European Journal of Combinatorics 25 (6), 835-862, 2004	87	2004
Induced Subdivisions In K_s,s-Free Graphs of Large Average Degree D Kuhn, D Osthus Combinatorica 24 (2), 287-304, 2004	87	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	86	2016
An exact minimum degree condition for Hamilton cycles in oriented graphs P Keevash, D Kühn, D Osthus Journal of the London Mathematical Society 79 (1), 144-166, 2009	77	2009
Hamilton decompositions of regular expanders: applications D Kühn, D Osthus Journal of Combinatorial Theory, Series B 104, 1-27, 2014	75	2014

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori