Deryk Osthus

发表

Solution to a problem of Erd\H{o}s on the chromatic index of hypergraphs with bounded codegree

Deryk Osthus, Dong Yeap Kang, Abhishek Methuku, 2021, 2110.06181.

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.

University of Birmingham Decompositions into isomorphic rainbow spanning trees

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

Minors in random regular graphs

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

Dirac’s theorem for random regular graphs

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

Proof of the 1-factorization and Hamilton Decomposition Conjectures

D. Kuhn, D. Osthus, Béla Csaba, 2014, 1401.4183.

The existence of designs via iterative absorption

Deryk Osthus, Allan Lo, Stefan Glock, 2016 .

Edge-decompositions of graphs with high minimum degree

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

Maximizing Several Cuts Simultaneously

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

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.

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.

A note on complete subdivisions in digraphs of large outdegree

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

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..

Surveys in Combinatorics 2009: Embedding large subgraphs into dense graphs

D. Kuhn, D. Osthus, Deryk Osthus, 2009, 0901.3541.

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.

The minimum degree threshold for perfect graph packings

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

Almost all graphs with high girth and suitable density have high chromatic number

Deryk Osthus, Anusch Taraz, Hans Jürgen Prömel, 2001, J. Graph Theory.

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..

Perfect matchings in random sparsifications of Dirac hypergraphs

Dong Yeap Kang, D. Kuhn, D. Osthus, 2022, 2211.01325.

Hamilton cycles in graphs and hypergraphs: an extremal perspective

D. Kuhn, D. Osthus, Deryk Osthus, 2014, 1402.4268.

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.

A bandwidth theorem for approximate decompositions

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

A blow-up lemma for approximate decompositions

D. Kuhn, D. Osthus, Jaehoon Kim, 2016, Transactions of the American Mathematical Society.

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.

The robust component structure of dense regular graphs and applications

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

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.

Almost all optimally coloured complete graphs contain a rainbow Hamilton path

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

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.

University of Birmingham Counting Hamilton cycles in Dirac hypergraphs

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

The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹

D. Kuhn, Stefan Glock, A. Lo, 2016, Memoirs of the American Mathematical Society.

Edge‐disjoint Hamilton cycles in random graphs

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

Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor

D. Kuhn, T. Kelly, Abhishek Methuku, 2022, 2206.14472.

Hamiltonicity of random subgraphs of the hypercube

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

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.

Resolution of the Oberwolfach problem

D. Kuhn, D. Osthus, Stefan Glock, 2018, Journal of the European Mathematical Society.

Optimal packings of bounded degree trees

D. Kuhn, D. Osthus, Felix Joos, 2016, Journal of the European Mathematical Society.

University of Birmingham Resolution of the Oberwolfach problem

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

Hypergraph $F$-designs for arbitrary $F$

Deryk Osthus, Allan Lo, Stefan Glock, 2017, 1706.01800.

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 random planar graphs, the number of planar graphs and their triangulations

Deryk Osthus, Anusch Taraz, Hans Jürgen Prömel, 2003, J. Comb. Theory, Ser. B.

Maximum Antichains in Random Subsets of a Finite Set

Deryk Osthus, Deryk Osthus, 2000, J. Comb. Theory, Ser. A.

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

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

Random maximal H-free graphs

Deryk Osthus, Anusch Taraz, A. Taraz, 2001, Random Struct. Algorithms.

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).

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

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

Cycles of given length in oriented graphs

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

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.

An exact minimum degree condition for Hamilton cycles in oriented graphs

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

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.

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.

Fractional clique decompositions of dense graphs and hypergraphs

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

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\H{o}s on locally sparse Steiner triple systems

Deryk Osthus, Allan Lo, Stefan Glock, 2018, 1802.04227.

Euler Tours in Hypergraphs

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

Euler Tours in Hypergraphs

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

University of Birmingham Euler tours in hypergraphs

Stefan Glock, Felix Joos, Deryk Osthus, 2020 .

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

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