Deryk Osthus

Comb. Probab. Comput., March, 2024

2023

Hypergraph regularity and random sampling.

[BibT_eX]

[DOI]

Random Struct. Algorithms, July, 2023

2022

Almost all optimally coloured complete graphs contain a rainbow Hamilton path.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

2021

Decompositions into isomorphic rainbow spanning trees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Counting Hamilton cycles in Dirac hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

Dirac's theorem for random regular graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree.

[BibT_eX]

[DOI]

Tom Kelly

CoRR, 2021

Graph and hypergraph colouring via nibble methods: A survey.

[BibT_eX]

[DOI]

CoRR, 2021

Hamiltonicity of random subgraphs of the hypercube.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

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

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Extremal aspects of graph and hypergraph decomposition problems.

[BibT_eX]

[DOI]

Stefan Glock

Proceedings of the Surveys in Combinatorics, 2021

2020

Rainbow structures in locally bounded colorings of graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, July, 2020

Minimalist designs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

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

[BibT_eX]

[DOI]

Comb., 2020

Euler Tours in Hypergraphs.

[BibT_eX]

[DOI]

Comb., 2020

2019

Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

On the decomposition threshold of a given graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

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

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

2018

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

2017

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Clique decompositions of multipartite graphs and completion of Latin squares.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2017

Fractional clique decompositions of dense graphs and hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

A Characterization of Testable Hypergraph Properties.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

A domination algorithm for {0, 1}-instances of the travelling salesman problem.

[BibT_eX]

[DOI]

Viresh Patel

Random Struct. Algorithms, 2016

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths.

[BibT_eX]

[DOI]

Timothy Townsend

Comb., 2016

2015

Arbitrary Orientations of Hamilton Cycles in Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Edge-disjoint Hamilton cycles in random graphs.

[BibT_eX]

[DOI]

Fiachra Knox

Random Struct. Algorithms, 2015

On the random greedy F-free hypergraph process.

[BibT_eX]

[DOI]

Amelia Taylor

Electron. Notes Discret. Math., 2015

Bipartitions of highly connected tournaments.

[BibT_eX]

[DOI]

Jaehoon Kim

Electron. Notes Discret. Math., 2015

Optimal path and cycle decompositions of dense quasirandom graphs.

[BibT_eX]

[DOI]

Stefan Glock

Electron. Notes Discret. Math., 2015

Edge-decompositions of graphs with high minimum degree.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

2014

Decompositions of complete uniform hypergraphs into Hamilton Berge cycles.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2014

Hamilton decompositions of regular expanders: Applications.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Fractional and integer matchings in uniform hypergraphs.

[BibT_eX]

[DOI]

Timothy Townsend

Eur. J. Comb., 2014

Optimal covers with Hamilton cycles in random graphs.

[BibT_eX]

[DOI]

Comb., 2014

2013

Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs.

[BibT_eX]

[DOI]

Katherine Staden

SIAM J. Discret. Math., 2013

Matchings in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Embedding cycles of given length in oriented graphs.

[BibT_eX]

[DOI]

Diana Piguet

Eur. J. Comb., 2013

Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree.

[BibT_eX]

[DOI]

John Lapinskas

Comb. Probab. Comput., 2013

2012

On Pósa's Conjecture for Random Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Approximate Hamilton decompositions of random graphs.

[BibT_eX]

[DOI]

Fiachra Knox

Random Struct. Algorithms, 2012

Finding Hamilton cycles in robustly expanding digraphs.

[BibT_eX]

[DOI]

Demetres Christofides

Peter Keevash

J. Graph Algorithms Appl., 2012

Edge-disjoint Hamilton cycles in graphs.

[BibT_eX]

[DOI]

Demetres Christofides

J. Comb. Theory B, 2012

A survey on Hamilton cycles in directed graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

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

[BibT_eX]

[DOI]

CoRR, 2012

2011

An approximate version of Sumnerʼs universal tournament conjecture.

[BibT_eX]

[DOI]

Richard Mycroft

J. Comb. Theory B, 2011

Matchings in 3-uniform hypergraphs of large minimum vertex degree.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

A proof of Sumner's universal tournament conjecture for large tournaments.

[BibT_eX]

[DOI]

Richard Mycroft

Electron. Notes Discret. Math., 2011

Loose Hamilton cycles in hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

A Semiexact Degree Condition for Hamilton Cycles in Digraphs.

[BibT_eX]

[DOI]

Demetres Christofides

Peter Keevash

SIAM J. Discret. Math., 2010

Hamiltonian degree sequences in digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Hamilton l-cycles in uniform hypergraphs.

[BibT_eX]

[DOI]

Richard Mycroft

J. Comb. Theory A, 2010

Cycles of given length in oriented graphs.

[BibT_eX]

[DOI]

Luke Kelly

J. Comb. Theory B, 2010

2009

An Ore-type Theorem for Perfect Packings in Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Minors in random regular graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

Short cycles in oriented graphs.

[BibT_eX]

[DOI]

Luke Kelly

Electron. Notes Discret. Math., 2009

Degree sequences forcing Hamilton cycles in directed graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

The minimum degree threshold for perfect graph packings.

[BibT_eX]

[DOI]

Comb., 2009

Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs.

[BibT_eX]

[DOI]

Comb., 2009

2008

A note on complete subdivisions in digraphs of large outdegree.

[BibT_eX]

[DOI]

Andrew Young

J. Graph Theory, 2008

k-Ordered Hamilton cycles in digraphs.

[BibT_eX]

[DOI]

Andrew Young

J. Comb. Theory B, 2008

3-Uniform hypergraphs of bounded degree have linear Ramsey numbers.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Linkedness and Ordered Cycles in Digraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

A Dirac-Type Result on Hamilton Cycles in Oriented Graphs.

[BibT_eX]

[DOI]

Luke Kelly

Comb. Probab. Comput., 2008

2007

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Ramsey numbers of sparse hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

The order of the largest complete minor in a random graph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Perfect packings with complete graphs minus an edge.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Maximizing Several Cuts Simultaneously.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

2006

Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Improved Bounds for Topological Cliques in Graphs of Large Girth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Matchings in hypergraphs of large minimum degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Extremal connectivity for topological cliques in bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Critical chromatic number and the complexity of perfect packings in graphs.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Spanning triangulations in graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Four-cycles in graphs without a given even cycle.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Large planar subgraphs in dense graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Forcing unbalanced complete bipartite minors.

[BibT_eX]

[DOI]

Eur. J. Comb., 2005

Packings in Dense Regular Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2005

2004

Popularity based random graph models leading to a scale-free degree sequence.

[BibT_eX]

[DOI]

Pierce G. Buckley

Discret. Math., 2004

Subdivisions of Kr+2 in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Large Topological Cliques in Graphs Without a 4-Cycle.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Complete Minors In Ks, s-Free Graphs.

[BibT_eX]

[DOI]

Comb., 2004

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

[BibT_eX]

[DOI]

Comb., 2004

Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree.

[BibT_eX]

[DOI]

Comb., 2004

2003

Minors in graphs of large girth.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

On random planar graphs, the number of planar graphs and their triangulations.

[BibT_eX]

[DOI]

Hans Jürgen Prömel

J. Comb. Theory B, 2003

Partitions of graphs with high minimum degree or connectivity.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?

[BibT_eX]

[DOI]

Hans Jürgen Prömel

Comb., 2003

2002

Topological Minors in Graphs of Large Girth.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

2001

Random maximal H-free graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

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

[BibT_eX]

[DOI]

Hans Jürgen Prömel

J. Graph Theory, 2001

2000

On the evolution of random discrete structures

[BibT_eX]

[DOI]

PhD thesis, 2000

The length of random subsets of Boolean lattices.

[BibT_eX]

[DOI]

Yoshiharu Kohayakawa

Bernd Kreuter

Random Struct. Algorithms, 2000

Maximum Antichains in Random Subsets of a Finite Set.

[BibT_eX]

[DOI]