Research output per year
Research output per year
Research output
- 7 Article
Search results
-
2011
Loose Hamilton cycles in hypergraphs
Keevash, P., Kuhn, D., Mycroft, R. & Osthus, D., 1 Apr 2011, In: Discrete Mathematics. 311, 7, p. 544-559 16 p.Research output: Contribution to journal › Article › peer-review
39 Citations (Scopus) -
2010
Hamilton l-cycles in uniform hypergraphs
Kuhn, D., Mycroft, R. & Osthus, D., 1 Oct 2010, In: Journal of Combinatorial Theory, Series A. 117, 7, p. 910-927 18 p.Research output: Contribution to journal › Article › peer-review
41 Citations (Scopus) -
2009
Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
Cooley, O., Fountoulakis, N., Kuhn, D. & Osthus, D., 1 May 2009, In: Combinatorica. 29, 3, p. 263-297 35 p.Research output: Contribution to journal › Article › peer-review
28 Citations (Scopus) -
Minors in Random Regular Graphs
Fountoulakis, N., Kuhn, D. & Osthus, D., 1 Dec 2009, In: Random Structures and Algorithms. 35, 4, p. 444-463 20 p.Research output: Contribution to journal › Article › peer-review
5 Citations (Scopus) -
The Minimum Degree Threshold for Perfect Graph Packings
Kuhn, D. & Osthus, D., 1 Jan 2009, In: Combinatorica. 29, 1, p. 65-107 43 p.Research output: Contribution to journal › Article › peer-review
68 Citations (Scopus) -
2008
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Cooley, O., Fountoulakis, N., Kuhn, D. & Osthus, D., 1 May 2008, In: Journal of Combinatorial Theory. Series B. 98, 3, p. 484-505 22 p.Research output: Contribution to journal › Article › peer-review
18 Citations (Scopus) -
The order of the largest complete minor in a random graph
Fountoulakis, N., Kuhn, D. & Osthus, D., 1 Sept 2008, In: Random Structures and Algorithms. 33, 2, p. 127-141 15 p.Research output: Contribution to journal › Article › peer-review
8 Citations (Scopus)