Daniela Kühn

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 38

Top Venues

J. Comb. Theory, Ser. B

CoRR

Random Struct. Algorithms

SIAM J. Discret. Math.

Publications

Tom Kelly, Daniela Kühn, Deryk Osthus
A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree. Comb. Probab. Comput. 33 (2) (2024)
Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus
Hypergraph regularity and random sampling. Random Struct. Algorithms 62 (4) (2023)
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. FOCS (2022)
Stephen Gould, Tom Kelly, Daniela Kühn, Deryk Osthus
Almost all optimally coloured complete graphs contain a rainbow Hamilton path. J. Comb. Theory, Ser. B 156 (2022)
Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus
Hamiltonicity of random subgraphs of the hypercube. SODA (2021)
Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus
Hypergraph regularity and random sampling. CoRR (2021)
Stefan Glock, Daniela Kühn, Deryk Osthus
Extremal aspects of graph and hypergraph decomposition problems. BCC (2021)
Tom Kelly, Daniela Kühn, Deryk Osthus
A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree. CoRR (2021)
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
Graph and hypergraph colouring via nibble methods: A survey. CoRR (2021)
Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus
Dirac's theorem for random regular graphs. Comb. Probab. Comput. 30 (1) (2021)
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. FOCS (2021)
Stefan Glock, Stephen Gould, Felix Joos, Daniela Kühn, Deryk Osthus
Counting Hamilton cycles in Dirac hypergraphs. Comb. Probab. Comput. 30 (4) (2021)
Stefan Glock, Daniela Kühn, Richard Montgomery, Deryk Osthus
Decompositions into isomorphic rainbow spanning trees. J. Comb. Theory, Ser. B 146 (2021)
Stefan Glock, Daniela Kühn, Allan Lo, Deryk Osthus
On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems. Comb. 40 (3) (2020)
Stefan Glock, Felix Joos, Daniela Kühn, Deryk Osthus
Euler Tours in Hypergraphs. Comb. 40 (5) (2020)
Jaehoon Kim, Daniela Kühn, Andrey Kupavskii, Deryk Osthus
Rainbow structures in locally bounded colorings of graphs. Random Struct. Algorithms 56 (4) (2020)
Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus
Minimalist designs. Random Struct. Algorithms 57 (1) (2020)
Padraig Condon, Alberto Espuny Díaz, Daniela Kühn, Deryk Osthus, Jaehoon Kim
Resilient Degree Sequences with respect to Hamilton Cycles and Matchings in Random Graphs. Electron. J. Comb. 26 (4) (2019)
Alberto Espuny Díaz, Felix Joos, Daniela Kühn, Deryk Osthus
Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing. SIAM J. Discret. Math. 33 (4) (2019)
Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus
On the decomposition threshold of a given graph. J. Comb. Theory, Ser. B 139 (2019)
Jaehoon Kim, Daniela Kühn, Deryk Osthus, Timothy Townsend
Forbidding induced even cycles in a graph: Typical structure and counting. J. Comb. Theory, Ser. B 131 (2018)
Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus
A characterization of testable hypergraph properties. CoRR (2017)
Ben Barber, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus
Fractional clique decompositions of dense graphs and hypergraphs. J. Comb. Theory, Ser. B 127 (2017)
Daniela Kühn, Deryk Osthus, Timothy Townsend, Yi Zhao
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles. J. Comb. Theory, Ser. B 124 (2017)
Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus
A Characterization of Testable Hypergraph Properties. FOCS (2017)
Ben Barber, Daniela Kühn, Allan Lo, Deryk Osthus, Amelia Taylor
Clique decompositions of multipartite graphs and completion of Latin squares. J. Comb. Theory, Ser. A 151 (2017)
Daniela Kühn, Deryk Osthus, Amelia Taylor
On the Random Greedy F-Free Hypergraph Process. SIAM J. Discret. Math. 30 (3) (2016)
Daniela Kühn, Allan Lo, Deryk Osthus, Katherine Staden
Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs. J. Comb. Theory, Ser. B 121 (2016)
Jaehoon Kim, Daniela Kühn, Deryk Osthus
Bipartitions of Highly Connected Tournaments. SIAM J. Discret. Math. 30 (2) (2016)
Stefan Glock, Daniela Kühn, Deryk Osthus
Optimal path and cycle decompositions of dense quasirandom graphs. J. Comb. Theory, Ser. B 118 (2016)
Daniela Kühn, Deryk Osthus, Timothy Townsend
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths. Comb. 36 (4) (2016)
Daniela Kühn, Deryk Osthus, Viresh Patel
A domination algorithm for {0, 1}-instances of the travelling salesman problem. Random Struct. Algorithms 48 (3) (2016)
Jaehoon Kim, Daniela Kühn, Deryk Osthus
Bipartitions of highly connected tournaments. Electron. Notes Discret. Math. 49 (2015)
Fiachra Knox, Daniela Kühn, Deryk Osthus
Edge-disjoint Hamilton cycles in random graphs. Random Struct. Algorithms 46 (3) (2015)
Louis DeBiasio, Daniela Kühn, Theodore Molla, Deryk Osthus, Amelia Taylor
Arbitrary Orientations of Hamilton Cycles in Digraphs. SIAM J. Discret. Math. 29 (3) (2015)
Stefan Glock, Daniela Kühn, Deryk Osthus
Optimal path and cycle decompositions of dense quasirandom graphs. Electron. Notes Discret. Math. 49 (2015)
Daniela Kühn, Deryk Osthus, Amelia Taylor
On the random greedy F-free hypergraph process. Electron. Notes Discret. Math. 49 (2015)
Ben Barber, Daniela Kühn, Allan Lo, Deryk Osthus
Edge-decompositions of graphs with high minimum degree. Electron. Notes Discret. Math. 49 (2015)
Daniela Kühn, Deryk Osthus, Viresh Patel
A domination algorithm for $\{0, 1\}$-instances of the travelling salesman problem. CoRR (2014)
Daniela Kühn, Deryk Osthus
Decompositions of complete uniform hypergraphs into Hamilton Berge cycles. J. Comb. Theory, Ser. A 126 (2014)
Daniela Kühn, Deryk Osthus, Timothy Townsend
Fractional and integer matchings in uniform hypergraphs. Eur. J. Comb. 38 (2014)
Dan Hefetz, Daniela Kühn, John Lapinskas, Deryk Osthus
Optimal covers with Hamilton cycles in random graphs. Comb. 34 (5) (2014)
Daniela Kühn, Deryk Osthus
Hamilton decompositions of regular expanders: Applications. J. Comb. Theory, Ser. B 104 (2014)
Daniela Kühn, Deryk Osthus, Diana Piguet
Embedding cycles of given length in oriented graphs. Eur. J. Comb. 34 (2) (2013)
Daniela Kühn, Deryk Osthus, Andrew Treglown
Matchings in 3-uniform hypergraphs. J. Comb. Theory, Ser. B 103 (2) (2013)
Daniela Kühn, John Lapinskas, Deryk Osthus
Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree. Comb. Probab. Comput. 22 (3) (2013)
Daniela Kühn, Deryk Osthus
A survey on Hamilton cycles in directed graphs. Eur. J. Comb. 33 (5) (2012)
Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus
Finding Hamilton cycles in robustly expanding digraphs. J. Graph Algorithms Appl. 16 (2) (2012)
Demetres Christofides, Daniela Kühn, Deryk Osthus
Edge-disjoint Hamilton cycles in graphs. J. Comb. Theory, Ser. B 102 (5) (2012)
Daniela Kühn, Deryk Osthus
Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments CoRR (2012)
Fiachra Knox, Daniela Kühn, Deryk Osthus
Approximate Hamilton decompositions of random graphs. Random Struct. Algorithms 40 (2) (2012)
Daniela Kühn, Deryk Osthus
On Pósa's Conjecture for Random Graphs. SIAM J. Discret. Math. 26 (3) (2012)
Deryk Osthus, Daniela Kühn, Richard Mycroft
A proof of Sumner's universal tournament conjecture for large tournaments. Electron. Notes Discret. Math. 38 (2011)
Peter Keevash, Daniela Kühn, Richard Mycroft, Deryk Osthus
Loose Hamilton cycles in hypergraphs. Discret. Math. 311 (7) (2011)
Daniela Kühn, Richard Mycroft, Deryk Osthus
An approximate version of Sumnerʼs universal tournament conjecture. J. Comb. Theory, Ser. B 101 (6) (2011)
Andrew Treglown, Daniela Kühn, Deryk Osthus
Matchings in 3-uniform hypergraphs of large minimum vertex degree. Electron. Notes Discret. Math. 38 (2011)
Daniela Kühn, Richard Mycroft, Deryk Osthus
-cycles in uniform hypergraphs. J. Comb. Theory, Ser. A 117 (7) (2010)
Daniela Kühn, Deryk Osthus, Andrew Treglown
Hamiltonian degree sequences in digraphs. J. Comb. Theory, Ser. B 100 (4) (2010)
Luke Kelly, Daniela Kühn, Deryk Osthus
Cycles of given length in oriented graphs. J. Comb. Theory, Ser. B 100 (3) (2010)
Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus
A Semiexact Degree Condition for Hamilton Cycles in Digraphs. SIAM J. Discret. Math. 24 (3) (2010)
Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
-uniform hypergraphs. Comb. 29 (3) (2009)
Deryk Osthus, Luke Kelly, Daniela Kühn
Short cycles in oriented graphs. Electron. Notes Discret. Math. 34 (2009)
Daniela Kühn, Deryk Osthus, Andrew Treglown
Degree sequences forcing Hamilton cycles in directed graphs. Electron. Notes Discret. Math. 34 (2009)
Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
Minors in random regular graphs. Random Struct. Algorithms 35 (4) (2009)
Daniela Kühn, Deryk Osthus
The minimum degree threshold for perfect graph packings. Comb. 29 (1) (2009)
Daniela Kühn, Deryk Osthus, Andrew Treglown
An Ore-type Theorem for Perfect Packings in Graphs. SIAM J. Discret. Math. 23 (3) (2009)
Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers. J. Comb. Theory, Ser. B 98 (3) (2008)
Daniela Kühn, Deryk Osthus, Andrew Young
A note on complete subdivisions in digraphs of large outdegree. J. Graph Theory 57 (1) (2008)
Luke Kelly, Daniela Kühn, Deryk Osthus
A Dirac-Type Result on Hamilton Cycles in Oriented Graphs. Comb. Probab. Comput. 17 (5) (2008)
Daniela Kühn, Deryk Osthus, Andrew Young
k-Ordered Hamilton cycles in digraphs. J. Comb. Theory, Ser. B 98 (6) (2008)
Daniela Kühn, Deryk Osthus
Linkedness and Ordered Cycles in Digraphs. Comb. Probab. Comput. 17 (3) (2008)
Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
The order of the largest complete minor in a random graph. Random Struct. Algorithms 33 (2) (2008)
Daniela Kühn, Deryk Osthus
Maximizing Several Cuts Simultaneously. Comb. Probab. Comput. 16 (2) (2007)
Oliver Cooley, Daniela Kühn, Deryk Osthus
Perfect packings with complete graphs minus an edge. Eur. J. Comb. 28 (8) (2007)
Deryk Osthus, Daniela Kühn
A minimum degree condition forcing a digraph to be k-linked. Electron. Notes Discret. Math. 29 (2007)
Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
The order of the largest complete minor in a random graph. Electron. Notes Discret. Math. 29 (2007)
Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus
Ramsey numbers of sparse hypergraphs. Electron. Notes Discret. Math. 29 (2007)
Daniela Kühn, Deryk Osthus
Extremal connectivity for topological cliques in bipartite graphs. J. Comb. Theory, Ser. B 96 (1) (2006)
Daniela Kühn, Deryk Osthus
Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs. SIAM J. Discret. Math. 20 (2) (2006)
Daniela Kühn, Deryk Osthus
Critical chromatic number and the complexity of perfect packings in graphs. SODA (2006)
Daniela Kühn, Deryk Osthus
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Comb. Theory, Ser. B 96 (6) (2006)
Daniela Kühn, Deryk Osthus
Improved Bounds for Topological Cliques in Graphs of Large Girth. SIAM J. Discret. Math. 20 (1) (2006)
Daniela Kühn, Deryk Osthus
Matchings in hypergraphs of large minimum degree. J. Graph Theory 51 (4) (2006)
Daniela Kühn, Deryk Osthus
Four-cycles in graphs without a given even cycle. J. Graph Theory 48 (2) (2005)
Daniela Kühn, Deryk Osthus
Spanning triangulations in graphs. J. Graph Theory 49 (3) (2005)
Daniela Kühn, Deryk Osthus
Forcing unbalanced complete bipartite minors. Eur. J. Comb. 26 (1) (2005)
Reinhard Diestel, Daniela Kühn
Graph minor hierarchies. Discret. Appl. Math. 145 (2) (2005)
Daniela Kühn, Deryk Osthus, Anusch Taraz
Large planar subgraphs in dense graphs. J. Comb. Theory, Ser. B 95 (2) (2005)
Daniela Kühn, Deryk Osthus
Packings in Dense Regular Graphs. Comb. Probab. Comput. 14 (3) (2005)
Daniela Kühn, Deryk Osthus
-Free Graphs. Comb. 25 (1) (2004)
Reinhard Diestel, Daniela Kühn
On Infinite Cycles II. Comb. 24 (1) (2004)
Daniela Kühn, Deryk Osthus
-Free Graphs of Large Average Degree. Comb. 24 (2) (2004)
Daniela Kühn, Deryk Osthus
in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth. Comb. Probab. Comput. 13 (3) (2004)
Reinhard Diestel, Daniela Kühn
Topological paths, cycles and spanning trees in infinite graphs. Eur. J. Comb. 25 (6) (2004)
Reinhard Diestel, Daniela Kühn
On Infinite Cycles I. Comb. 24 (1) (2004)
Daniela Kühn, Deryk Osthus
-Free Subgraph of Large Average Degree. Comb. 24 (1) (2004)
Daniela Kühn, Deryk Osthus
Large Topological Cliques in Graphs Without a 4-Cycle. Comb. Probab. Comput. 13 (1) (2004)
Daniela Kühn, Deryk Osthus
Partitions of graphs with high minimum degree or connectivity. J. Comb. Theory, Ser. B 88 (1) (2003)
Reinhard Diestel, Daniela Kühn
Graph-theoretical versus topological ends of graphs. J. Comb. Theory, Ser. B 87 (1) (2003)
Daniela Kühn, Deryk Osthus
Minors in graphs of large girth. Random Struct. Algorithms 22 (2) (2003)

Daniela Kühn.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniela Kühn