Maximum Antichains in Random Subsets of a Finite Set. - Deryk Osthus (J. Comb. Theory A, 2000)

The length of random subsets of Boolean lattices. - Yoshiharu Kohayakawa; Bernd Kreuter; Deryk Osthus (Random Struct. Algorithms, 2000)

On the evolution of random discrete structures - Deryk Osthus (2000)

Almost all graphs with high girth and suitable density have high chromatic number. - Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz (J. Graph Theory, 2001)

Random maximal H-free graphs. - Deryk Osthus; Anusch Taraz (Random Struct. Algorithms, 2001)

Topological Minors in Graphs of Large Girth. - Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2002)

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? - Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz (Comb., 2003)

Partitions of graphs with high minimum degree or connectivity. - Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2003)

On random planar graphs, the number of planar graphs and their triangulations. - Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz (J. Comb. Theory B, 2003)

Minors in graphs of large girth. - Daniela Kühn; Deryk Osthus (Random Struct. Algorithms, 2003)

Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree. - Daniela Kühn; Deryk Osthus (Comb., 2004)

Induced Subdivisions In Ks, s-Free Graphs of Large Average Degree. - Daniela Kühn; Deryk Osthus (Comb., 2004)

Complete Minors In Ks, s-Free Graphs. - Daniela Kühn; Deryk Osthus (Comb., 2004)

Large Topological Cliques in Graphs Without a 4-Cycle. - Daniela Kühn; Deryk Osthus (Comb. Probab. Comput., 2004)

Subdivisions of Kr+2 in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth. - Daniela Kühn; Deryk Osthus (Comb. Probab. Comput., 2004)

Popularity based random graph models leading to a scale-free degree sequence. - Pierce G. Buckley; Deryk Osthus (Discret. Math., 2004)

Packings in Dense Regular Graphs. - Daniela Kühn; Deryk Osthus (Comb. Probab. Comput., 2005)

Forcing unbalanced complete bipartite minors. - Daniela Kühn; Deryk Osthus (Eur. J. Comb., 2005)

Large planar subgraphs in dense graphs. - Daniela Kühn; Deryk Osthus; Anusch Taraz (J. Comb. Theory B, 2005)

Four-cycles in graphs without a given even cycle. - Daniela Kühn; Deryk Osthus (J. Graph Theory, 2005)

Spanning triangulations in graphs. - Daniela Kühn; Deryk Osthus (J. Graph Theory, 2005)

Critical chromatic number and the complexity of perfect packings in graphs. - Daniela Kühn; Deryk Osthus (SODA, 2006)

Extremal connectivity for topological cliques in bipartite graphs. - Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2006)

Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. - Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2006)

Matchings in hypergraphs of large minimum degree. - Daniela Kühn; Deryk Osthus (J. Graph Theory, 2006)

Improved Bounds for Topological Cliques in Graphs of Large Girth. - Daniela Kühn; Deryk Osthus (SIAM J. Discret. Math., 2006)

Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs. - Daniela Kühn; Deryk Osthus (SIAM J. Discret. Math., 2006)

Maximizing Several Cuts Simultaneously. - Daniela Kühn; Deryk Osthus (Comb. Probab. Comput., 2007)

Perfect packings with complete graphs minus an edge. - Oliver Cooley; Daniela Kühn; Deryk Osthus (Eur. J. Comb., 2007)

The order of the largest complete minor in a random graph. - Nikolaos Fountoulakis; Daniela Kühn; Deryk Osthus (Electron. Notes Discret. Math., 2007)

Ramsey numbers of sparse hypergraphs. - Daniela Kühn; Oliver Cooley; Nikolaos Fountoulakis; Deryk Osthus (Electron. Notes Discret. Math., 2007)

A minimum degree condition forcing a digraph to be k-linked. - Deryk Osthus; Daniela Kühn (Electron. Notes Discret. Math., 2007)

A Dirac-Type Result on Hamilton Cycles in Oriented Graphs. - Luke Kelly; Daniela Kühn; Deryk Osthus (Comb. Probab. Comput., 2008)

Linkedness and Ordered Cycles in Digraphs. - Daniela Kühn; Deryk Osthus (Comb. Probab. Comput., 2008)

3-Uniform hypergraphs of bounded degree have linear Ramsey numbers. - Oliver Cooley; Nikolaos Fountoulakis; Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2008)

k-Ordered Hamilton cycles in digraphs. - Daniela Kühn; Deryk Osthus; Andrew Young (J. Comb. Theory B, 2008)

A note on complete subdivisions in digraphs of large outdegree. - Daniela Kühn; Deryk Osthus; Andrew Young (J. Graph Theory, 2008)

Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs. - Oliver Cooley; Nikolaos Fountoulakis; Daniela Kühn; Deryk Osthus (Comb., 2009)

The minimum degree threshold for perfect graph packings. - Daniela Kühn; Deryk Osthus (Comb., 2009)

Degree sequences forcing Hamilton cycles in directed graphs. - Daniela Kühn; Deryk Osthus; Andrew Treglown (Electron. Notes Discret. Math., 2009)

Short cycles in oriented graphs. - Deryk Osthus; Luke Kelly; Daniela Kühn (Electron. Notes Discret. Math., 2009)

Minors in random regular graphs. - Nikolaos Fountoulakis; Daniela Kühn; Deryk Osthus (Random Struct. Algorithms, 2009)

An Ore-type Theorem for Perfect Packings in Graphs. - Daniela Kühn; Deryk Osthus; Andrew Treglown (SIAM J. Discret. Math., 2009)

Cycles of given length in oriented graphs. - Luke Kelly; Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2010)

Hamilton l-cycles in uniform hypergraphs. - Daniela Kühn; Richard Mycroft; Deryk Osthus (J. Comb. Theory A, 2010)

Hamiltonian degree sequences in digraphs. - Daniela Kühn; Deryk Osthus; Andrew Treglown (J. Comb. Theory B, 2010)

A Semiexact Degree Condition for Hamilton Cycles in Digraphs. - Demetres Christofides; Peter Keevash; Daniela Kühn; Deryk Osthus (SIAM J. Discret. Math., 2010)

Loose Hamilton cycles in hypergraphs. - Peter Keevash; Daniela Kühn; Richard Mycroft; Deryk Osthus (Discret. Math., 2011)

A proof of Sumner's universal tournament conjecture for large tournaments. - Deryk Osthus; Daniela Kühn; Richard Mycroft (Electron. Notes Discret. Math., 2011)

Matchings in 3-uniform hypergraphs of large minimum vertex degree. - Andrew Treglown; Daniela Kühn; Deryk Osthus (Electron. Notes Discret. Math., 2011)

An approximate version of Sumnerʼs universal tournament conjecture. - Daniela Kühn; Richard Mycroft; Deryk Osthus (J. Comb. Theory B, 2011)

Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments - Daniela Kühn; Deryk Osthus (CoRR, 2012)

A survey on Hamilton cycles in directed graphs. - Daniela Kühn; Deryk Osthus (Eur. J. Comb., 2012)

Edge-disjoint Hamilton cycles in graphs. - Demetres Christofides; Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2012)

Finding Hamilton cycles in robustly expanding digraphs. - Demetres Christofides; Peter Keevash; Daniela Kühn; Deryk Osthus (J. Graph Algorithms Appl., 2012)

Approximate Hamilton decompositions of random graphs. - Fiachra Knox; Daniela Kühn; Deryk Osthus (Random Struct. Algorithms, 2012)

On Pósa's Conjecture for Random Graphs. - Daniela Kühn; Deryk Osthus (SIAM J. Discret. Math., 2012)

Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree. - Daniela Kühn; John Lapinskas; Deryk Osthus (Comb. Probab. Comput., 2013)

Embedding cycles of given length in oriented graphs. - Daniela Kühn; Deryk Osthus; Diana Piguet (Eur. J. Comb., 2013)

Matchings in 3-uniform hypergraphs. - Daniela Kühn; Deryk Osthus; Andrew Treglown (J. Comb. Theory B, 2013)

Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs. - Deryk Osthus; Katherine Staden (SIAM J. Discret. Math., 2013)

Optimal covers with Hamilton cycles in random graphs. - Dan Hefetz; Daniela Kühn; John Lapinskas; Deryk Osthus (Comb., 2014)

Fractional and integer matchings in uniform hypergraphs. - Daniela Kühn; Deryk Osthus; Timothy Townsend (Eur. J. Comb., 2014)

Hamilton decompositions of regular expanders: Applications. - Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2014)

Decompositions of complete uniform hypergraphs into Hamilton Berge cycles. - Daniela Kühn; Deryk Osthus (J. Comb. Theory A, 2014)

Edge-decompositions of graphs with high minimum degree. - Ben Barber; Daniela Kühn; Allan Lo; Deryk Osthus (Electron. Notes Discret. Math., 2015)

Bipartitions of highly connected tournaments. - Jaehoon Kim; Daniela Kühn; Deryk Osthus (Electron. Notes Discret. Math., 2015)

On the random greedy F-free hypergraph process. - Daniela Kühn; Deryk Osthus; Amelia Taylor (Electron. Notes Discret. Math., 2015)

Edge-disjoint Hamilton cycles in random graphs. - Fiachra Knox; Daniela Kühn; Deryk Osthus (Random Struct. Algorithms, 2015)

Arbitrary Orientations of Hamilton Cycles in Digraphs. - Louis DeBiasio; Daniela Kühn; Theodore Molla; Deryk Osthus; Amelia Taylor (SIAM J. Discret. Math., 2015)

Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths. - Daniela Kühn; Deryk Osthus; Timothy Townsend (Comb., 2016)

Optimal path and cycle decompositions of dense quasirandom graphs. - Stefan Glock; Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2016)

Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs. - Daniela Kühn; Allan Lo; Deryk Osthus; Katherine Staden (J. Comb. Theory B, 2016)

A domination algorithm for {0, 1}-instances of the travelling salesman problem. - Daniela Kühn; Deryk Osthus; Viresh Patel (Random Struct. Algorithms, 2016)

Fractional clique decompositions of dense graphs and hypergraphs. - Ben Barber; Daniela Kühn; Allan Lo; Richard Montgomery 001; Deryk Osthus (J. Comb. Theory B, 2017)

Clique decompositions of multipartite graphs and completion of Latin squares. - Ben Barber; Daniela Kühn; Allan Lo; Deryk Osthus; Amelia Taylor (J. Comb. Theory A, 2017)

On the structure of oriented graphs and digraphs with forbidden tournaments or cycles. - Daniela Kühn; Deryk Osthus; Timothy Townsend; Yi Zhao 005 (J. Comb. Theory B, 2017)

Forbidding induced even cycles in a graph: Typical structure and counting. - Jaehoon Kim; Daniela Kühn; Deryk Osthus; Timothy Townsend (J. Comb. Theory B, 2018)

Resilient Degree Sequences with respect to Hamilton Cycles and Matchings in Random Graphs. - Padraig Condon; Alberto Espuny Díaz; Daniela Kühn; Deryk Osthus; Jaehoon Kim (Electron. J. Comb., 2019)

On the decomposition threshold of a given graph. - Stefan Glock; Daniela Kühn; Allan Lo; Richard Montgomery 001; Deryk Osthus (J. Comb. Theory B, 2019)

Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing. - Alberto Espuny Díaz; Felix Joos; Daniela Kühn; Deryk Osthus (SIAM J. Discret. Math., 2019)

Euler Tours in Hypergraphs. - Stefan Glock; Felix Joos; Daniela Kühn; Deryk Osthus (Comb., 2020)

On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems. - Stefan Glock; Daniela Kühn; Allan Lo; Deryk Osthus (Comb., 2020)

Minimalist designs. - Ben Barber; Stefan Glock; Daniela Kühn; Allan Lo; Richard Montgomery 001; Deryk Osthus (Random Struct. Algorithms, 2020)

Rainbow structures in locally bounded colorings of graphs. - Jaehoon Kim; Daniela Kühn; Andrey Kupavskii; Deryk Osthus (Random Struct. Algorithms, 2020)

Extremal aspects of graph and hypergraph decomposition problems. - Stefan Glock; Daniela Kühn; Deryk Osthus (BCC, 2021)

A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. - Dong Yeap Kang; Tom Kelly 001; Daniela Kühn; Abhishek Methuku; Deryk Osthus (FOCS, 2021)

Hamiltonicity of random subgraphs of the hypercube. - Padraig Condon; Alberto Espuny Díaz; António Girão; Daniela Kühn; Deryk Osthus (SODA, 2021)

Graph and hypergraph colouring via nibble methods: A survey. - Dong Yeap Kang; Tom Kelly 001; Daniela Kühn; Abhishek Methuku; Deryk Osthus (CoRR, 2021)

A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree. - Tom Kelly 001; Daniela Kühn; Deryk Osthus (CoRR, 2021)

Dirac's theorem for random regular graphs. - Padraig Condon; Alberto Espuny Díaz; António Girão; Daniela Kühn; Deryk Osthus (Comb. Probab. Comput., 2021)

Counting Hamilton cycles in Dirac hypergraphs. - Stefan Glock; Stephen Gould; Felix Joos; Daniela Kühn; Deryk Osthus (Comb. Probab. Comput., 2021)

Decompositions into isomorphic rainbow spanning trees. - Stefan Glock; Daniela Kühn; Richard Montgomery 001; Deryk Osthus (J. Comb. Theory B, 2021)

Almost all optimally coloured complete graphs contain a rainbow Hamilton path. - Stephen Gould; Tom Kelly 001; Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2022)

Hypergraph regularity and random sampling. - Felix Joos; Jaehoon Kim; Daniela Kühn; Deryk Osthus (Random Struct. Algorithms, 2023)

A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree. - Tom Kelly 001; Daniela Kühn; Deryk Osthus (Comb. Probab. Comput., 2024)

Perfect Matchings in Random Sparsifications of Dirac Hypergraphs. - Dong Yeap Kang; Tom Kelly 001; Daniela Kühn; Deryk Osthus; Vincent Pfenninger (Comb., 2024)

A characterization of testable hypergraph properties. - Felix Joos; Jaehoon Kim; Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2025)