D. Kühn

发表

The robust component structure of dense regular graphs and applications

Deryk Osthus, Allan Lo, Katherine Staden, 2014, 1401.0424.

Problems for the Barbados Graph Theory Workshop

D. Eppstein, A. Scott, J. Fox, 2018 .

Problems for the Barbados Graph Theory Workshop 2017

D. Eppstein, A. Scott, J. Fox, 2017 .

Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments pdf

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2012, ArXiv.

A survey on Hamilton cycles in directed graphs

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2010, Eur. J. Comb..

A Semiexact Degree Condition for Hamilton Cycles in Digraphs

Daniela Kühn, Deryk Osthus, Demetres Christofides, 2010, SIAM J. Discret. Math..

Hamilton decompositions of regular tournaments

Deryk Osthus, Andrew Treglown, Daniela Kuhn, 2009, 0908.3411.

Hamiltonian degree sequences in digraphs

Daniela Kühn, Deryk Osthus, Andrew Treglown, 2008, J. Comb. Theory, Ser. B.

Cycles of given length in oriented graphs

Daniela Kühn, Deryk Osthus, Luke Kelly, 2008, J. Comb. Theory, Ser. B.

An exact minimum degree condition for Hamilton cycles in oriented graphs

Deryk Osthus, Peter Keevash, Daniela Kuhn, 2008, 0801.0394.

A Dirac-Type Result on Hamilton Cycles in Oriented Graphs

Daniela Kühn, Deryk Osthus, Luke Kelly, 2007, Combinatorics, Probability and Computing.

A minimum degree condition forcing a digraph to be k-linked

Daniela Kühn, Deryk Osthus, Deryk Osthus, 2007, Electron. Notes Discret. Math..

k-Ordered Hamilton cycles in digraphs

Daniela Kühn, Deryk Osthus, Andrew Young, 2007, J. Comb. Theory, Ser. B.

Linkedness and Ordered Cycles in Digraphs

Daniela Kühn, Deryk Osthus, Deryk Osthus, 2007, Combinatorics, Probability and Computing.

On well-quasi-ordering infinite trees – Nash–Williams's theorem revisited

Daniela Kühn, D. Kühn, 2001, Mathematical Proceedings of the Cambridge Philosophical Society.

Hamiltonicity of random subgraphs of the hypercube

Alberto Espuny Díaz, D. Osthus, Daniela Kühn, 2020, SODA.

Dirac’s theorem for random regular graphs

Alberto Espuny Díaz, D. Osthus, Daniela Kühn, 2019, Combinatorics, Probability and Computing.

Resilient Degree Sequences with respect to Hamilton Cycles and Matchings in Random Graphs

Daniela Kühn, Deryk Osthus, Jaehoon Kim, 2018, Electron. J. Comb..

On Pósa's Conjecture for Random Graphs

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2012, SIAM J. Discret. Math..

New bounds on the size of nearly perfect matchings in almost regular hypergraphs

Dong Yeap Kang, D. Kuhn, D. Osthus, 2020, Journal of the London Mathematical Society.

Extremal aspects of graph and hypergraph decomposition problems

Daniela Kühn, Stefan Glock, Deryk Osthus, 2020, BCC.

The existence of designs via iterative absorption

Deryk Osthus, Allan Lo, Stefan Glock, 2016 .

Fractional clique decompositions of dense graphs and hypergraphs

Daniela Kühn, Deryk Osthus, Allan Lo, 2015, J. Comb. Theory, Ser. B.

Edge-decompositions of graphs with high minimum degree

Daniela Kühn, Deryk Osthus, Allan Lo, 2014, Electron. Notes Discret. Math..

University of Birmingham Fractional clique decompositions of dense graphs and hypergraphs

D. Osthus, LO Allan, D. Kühn, 2017 .

On the decomposition threshold of a given graph

Daniela Kühn, Deryk Osthus, Richard Montgomery, 2016, J. Comb. Theory, Ser. B.

Clique decompositions of multipartite graphs and completion of Latin squares

Daniela Kühn, Deryk Osthus, Amelia Taylor, 2016, J. Comb. Theory, Ser. A.

Partitions of graphs with high minimum degree or connectivity

Daniela Kühn, Deryk Osthus, Deryk Osthus, 2003, J. Comb. Theory, Ser. B.

On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems

Daniela Kühn, Deryk Osthus, Stefan Glock, 2020, Comb..

Graph and hypergraph colouring via nibble methods: A survey

Dong Yeap Kang, Daniela Kühn, T. Kelly, 2021, ArXiv.

Euler Tours in Hypergraphs

Stefan Glock, Felix Joos, Deryk Osthus, 2020, Combinatorica.

Counting Hamilton cycles in Dirac hypergraphs

Daniela Kühn, Deryk Osthus, Felix Joos, 2019, Comb. Probab. Comput..

Euler Tours in Hypergraphs

Daniela Kühn, Deryk Osthus, Felix Joos, 2018, Comb..

University of Birmingham Counting Hamilton cycles in Dirac hypergraphs

D. Osthus, Daniela Kühn, Stefan Glock, 2021 .

University of Birmingham Euler tours in hypergraphs

Stefan Glock, Felix Joos, Deryk Osthus, 2020 .

Fractional and integer matchings in uniform hypergraphs

Daniela Kühn, Deryk Osthus, Timothy Townsend, 2013, Eur. J. Comb..

Matchings in 3-uniform hypergraphs

Daniela Kühn, Deryk Osthus, Andrew Treglown, 2010, J. Comb. Theory, Ser. B.

Hamilton l-cycles in uniform hypergraphs

Daniela Kühn, Deryk Osthus, Richard Mycroft, 2009, J. Comb. Theory, Ser. A.

Loose Hamilton cycles in hypergraphs

Daniela Kühn, Deryk Osthus, Peter Keevash, 2008, Discret. Math..

Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2006, J. Comb. Theory, Ser. B.

Matchings in hypergraphs of large minimum degree

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2006, J. Graph Theory.

The minimum degree threshold for perfect graph packings

D. Osthus, Daniela Kühn, Deryk Osthus, 2006, Comb..

Forbidding induced even cycles in a graph: Typical structure and counting

Daniela Kühn, Deryk Osthus, Timothy Townsend, 2015, J. Comb. Theory B.

On the structure of oriented graphs and digraphs with forbidden tournaments or cycles

Timothy Townsend, D. Osthus, D. Kühn, 2014, J. Comb. Theory B.

University of Birmingham On the structure of oriented graphs and digraphs with forbidden tournaments or cycles

Timothy Townsend, Deryk Osthus, D. Kühn, 2015 .

Critical chromatic number and the complexity of perfect packings in graphs

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2006, SODA '06.