Daniela Kühn

发表

Spanning triangulations in graphs

D. Osthus, Daniela Kühn, 2005 .

A bandwidth theorem for approximate decompositions

D. Osthus, Daniela Kühn, Jaehoon Kim, 2017, Proceedings of the London Mathematical Society.

An exact minimum degree condition for Hamilton cycles in oriented graphs

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

Hamilton decompositions of regular tournaments

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

Multicoloured Hamilton cycles and perfect matchings in pseudo-random graphs

Daniela Kühn, Deryk Osthus, D. Osthus, 2004 .

Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments

Deryk Osthus, Viresh Patel, John Lapinskas, 2014 .

The existence of designs via iterative absorption

Deryk Osthus, Allan Lo, Stefan Glock, 2016 .

The robust component structure of dense regular graphs and applications

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

Edge‐disjoint Hamilton cycles in random graphs

Daniela Kühn, Deryk Osthus, Fiachra Knox, 2011, Random Struct. Algorithms.

Rainbow structures in locally bounded colorings of graphs

Andrey Kupavskii, Deryk Osthus, Jaehoon Kim, 2018 .

Embedding cycles of given length in oriented graphs

Diana Piguet, Daniela Kühn, Deryk Osthus, 2013, Eur. J. Comb..

Dirac’s theorem for random regular graphs

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

On Infinite Cycles I

Reinhard Diestel, Daniela Kühn, Daniela Kühn, 2004, Comb..

Hamilton l-cycles in k-graphs

D. Osthus, Daniela Kühn, Richard Mycroft, 2009 .

The robust component structure of dense regular graphs

D. Osthus, Daniela Kühn, Katherine Staden, 2013 .

Almost all optimally coloured complete graphs contain a rainbow Hamilton path

D. Osthus, Daniela Kühn, T. Kelly, 2020, J. Comb. Theory, Ser. B.

A universal planar graph under the minor relation

Daniela Kühn, R. Diestel, 1999 .

Semester Report Ss04 of Daniela Kühn

Daniela Kühn, M. Aigner, 2003 .

Maximizing Several Cuts Simultaneously

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

University of Birmingham Decompositions into isomorphic rainbow spanning trees

R. Montgomery, D. Osthus, Daniela Kühn, 2020 .

University of Birmingham Path and cycle decompositions of dense graphs

D. Osthus, Daniela Kühn, António Girão, 2020 .

University of Birmingham On a conjecture of Erdős on locally sparse Steiner triple systems

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

Hamiltonicity of random subgraphs of the hypercube

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

University of Birmingham Counting Hamilton cycles in Dirac hypergraphs

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

A note on complete subdivisions in digraphs of large outdegree

D. Osthus, Daniela Kühn, Andrew Young, 2006, J. Graph Theory.

University of Birmingham Arbitrary orientations of Hamilton cycles in digraphs

D. Osthus, Daniela Kühn, Amelia Taylor, 2015 .

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

D. Osthus, Daniela Kühn, Stefan Glock, 2020, Combinatorica.

Optimal covers with Hamilton cycles in random graphs

D. Osthus, Daniela Kühn, Dan Hefetz, 2014, Combinatorica.

The minimum degree threshold for perfect graph packings

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

Graph and hypergraph colouring via nibble methods: A survey

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

Decompositions into isomorphic rainbow spanning trees

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

Minors in random regular graphs

Daniela Kühn, Deryk Osthus, Nikolaos Fountoulakis, 2008, Random Struct. Algorithms.

Edge-decompositions of graphs with high minimum degree

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

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

Yi Zhao, Daniela Kühn, Deryk Osthus, 2014, J. Comb. Theory, Ser. B.

On Infinite Cycles II

Reinhard Diestel, Daniela Kühn, Daniela Kühn, 2004, Comb..

Topological paths, cycles and spanning trees in infinite graphs

Reinhard Diestel, Daniela Kühn, Daniela Kühn, 2004, Eur. J. Comb..

Graph-theoretical versus topological ends of graphs

Reinhard Diestel, Daniela Kühn, Daniela Kühn, 2003, J. Comb. Theory, Ser. B.

Counting Hamilton cycles in Dirac hypergraphs

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

Improved Bounds for Topological Cliques in Graphs of Large Girth

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

Extremal connectivity for topological cliques in bipartite graphs

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

Large planar subgraphs in dense graphs

Daniela Kühn, Deryk Osthus, Anusch Taraz, 2005, J. Comb. Theory, Ser. B.

Four‐cycles in graphs without a given even cycle

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

Complete Minors In Ks,s-Free Graphs

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2004, Comb..

Topological Minors in Graphs of Large Girth

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

Forcing unbalanced complete bipartite minors

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

A survey on Hamilton cycles in directed graphs

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

An Ore-type Theorem for Perfect Packings in Graphs

Daniela Kühn, Deryk Osthus, Andrew Treglown, 2008, SIAM J. Discret. Math..

A Dirac-Type Result on Hamilton Cycles in Oriented Graphs

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

Large Topological Cliques in Graphs Without a 4-Cycle

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

Graph minor hierarchies

Reinhard Diestel, Daniela Kühn, Daniela Kühn, 2005, Discret. Appl. Math..

Minors in graphs of large girth

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2003, Random Struct. Algorithms.

Fractional and integer matchings in uniform hypergraphs

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

Automatic Exploration of Machine Learning Experiments on OpenML pdf

Bernd Bischl, Philipp Probst, Janek Thomas, 2018, ArXiv.

Hamilton l-cycles in uniform hypergraphs

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

Induced Subdivisions In Ks,s-Free Graphs of Large Average Degree

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2004, Comb..

A Characterization of Testable Hypergraph Properties

Daniela Kühn, Deryk Osthus, Jaehoon Kim, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

On the decomposition threshold of a given graph

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

Hamiltonian degree sequences in digraphs

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

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 3-uniform hypergraphs

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

Critical chromatic number and the complexity of perfect packings in graphs

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

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.

Finding Hamilton cycles in robustly expanding digraphs

Daniela Kühn, Deryk Osthus, Demetres Christofides, 2012, J. Graph Algorithms Appl..

Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs

Daniela Kühn, Deryk Osthus, Nikolaos Fountoulakis, 2006, Comb..

Matchings in hypergraphs of large minimum degree

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

A universal planar graph under the minor relation

Reinhard Diestel, Daniela Kühn, Daniela Kühn, 1999, J. Graph Theory.

Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs

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

Minimalist designs

Daniela Kühn, Deryk Osthus, Allan Lo, 2018, Random Struct. Algorithms.

Clique decompositions of multipartite graphs and completion of Latin squares

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

Extremal aspects of graph and hypergraph decomposition problems

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

University of Birmingham Resolution of the Oberwolfach problem

Daniela Kühn, Felix Joos, Jaehoon Kim, 2021 .

Optimal path and cycle decompositions of dense quasirandom graphs

Daniela Kühn, Deryk Osthus, Stefan Glock, 2015, Electron. Notes Discret. Math..

Hamilton decompositions of regular expanders: Applications

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2012, 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..

Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree

Daniela Kühn, Deryk Osthus, John Lapinskas, 2012, Combinatorics, Probability and Computing.

On Pósa's Conjecture for Random Graphs

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

Decompositions of complete uniform hypergraphs into Hamilton Berge cycles

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2014, J. Comb. Theory, Ser. A.

The order of the largest complete minor in a random graph

Daniela Kühn, Deryk Osthus, Nikolaos Fountoulakis, 2007, Random Struct. Algorithms.

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

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

Arbitrary Orientations of Hamilton Cycles in Digraphs

Louis DeBiasio, Daniela Kühn, Theodore Molla, 2014, SIAM J. Discret. Math..

A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects

Daniela Kühn, T. Kelly, Abhishek Methuku, 2022, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).

Cycles of given length in oriented graphs

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