Research output per year
Research output per year
Research output
- 13 Article
- 13 results
Search results
-
2015
Edge-disjoint hamilton cycles in random graphs
Knox, F., Kühn, D. & Osthus, D., 1 May 2015, In: Random Structures and Algorithms. 46, 3, p. 397-445 49 p.Research output: Contribution to journal › Article › peer-review
26 Citations (Scopus) -
2012
A note on some embedding problems for oriented graphs
Treglown, A., 16 Feb 2012, In: Journal of Graph Theory. 69, p. 330-336Research output: Contribution to journal › Article › peer-review
Open AccessFile6 Citations (Scopus)163 Downloads (Pure) -
Approximate Hamilton decompositions of random graphs
Knox, F., Kuhn, D. & Osthus, D., 1 Mar 2012, In: Random Structures and Algorithms. 40, 2, p. 133-149 17 p.Research output: Contribution to journal › Article › peer-review
11 Citations (Scopus) -
2011
An approximate version of Sumner's universal tournament conjecture☆
Kuhn, D., Mycroft, R. & Osthus, D., 26 Jan 2011, In: Journal of Combinatorial Theory. Series B. 101, p. 415-447 33 p.Research output: Contribution to journal › Article › peer-review
12 Citations (Scopus) -
A proof of Sumner's universal tournament conjecture for large tournaments
Kuhn, D., Mycroft, R. & Osthus, D., 1 Apr 2011, In: London Mathematical Society. Proceedings . 102, p. 731-766 36 p.Research output: Contribution to journal › Article › peer-review
16 Citations (Scopus) -
2010
A Semiexact Degree Condition for Hamilton Cycles in Digraphs
Christofides, D., Keevash, P., Kuhn, D. & Osthus, D., 1 Jan 2010, In: SIAM Journal on Discrete Mathematics. 24, 3, p. 709-756 48 p.Research output: Contribution to journal › Article › peer-review
6 Citations (Scopus) -
Cycles of given length in oriented graphs
Kelly, L., Kuhn, D. & Osthus, D., 1 May 2010, In: Journal of Combinatorial Theory. Series B. 100, 3, p. 251-264 14 p.Research output: Contribution to journal › Article › peer-review
5 Citations (Scopus) -
Hamilton decompositions of regular tournaments
Kuhn, D., Osthus, D. & Treglown, A., 1 Jul 2010, In: London Mathematical Society. Proceedings . 101, p. 303-335 33 p.Research output: Contribution to journal › Article › peer-review
13 Citations (Scopus) -
Hamiltonian degree sequences in digraphs
Kuhn, D., Osthus, D. & Treglown, A., 1 Jul 2010, In: Journal of Combinatorial Theory. Series B. 100, 4, p. 367-380 14 p.Research output: Contribution to journal › Article › peer-review
31 Citations (Scopus) -
2009
An exact minimum degree condition for Hamilton cycles in oriented graphs
Keevash, P., Kuhn, D. & Osthus, D., 5 Jan 2009, In: Journal of the London Mathematical Society. 79, 1, p. 144-166 23 p.Research output: Contribution to journal › Article › peer-review
26 Citations (Scopus) -
An Ore-type theorem for perfect packings in graphs
Kuhn, D., Osthus, D. & Treglown, A., 1 Jan 2009, In: SIAM Journal on Discrete Mathematics. 23, p. 1335-1355 21 p.Research output: Contribution to journal › Article
11 Citations (Scopus) -
2008
A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
Kelly, L., Kuhn, D. & Osthus, D., 1 Sept 2008, In: Combinatorics, Probability and Computing. 17, 05Research output: Contribution to journal › Article
18 Citations (Scopus) -
k-Ordered Hamilton cycles in digraphs
Kuhn, D., Osthus, D. & Young, A., 1 Nov 2008, In: Journal of Combinatorial Theory. Series B. 98, 6, p. 1165-1180 16 p.Research output: Contribution to journal › Article › peer-review
2 Citations (Scopus)