Deryk Osthus

From MaRDI portal
Person:256989

Available identifiers

zbMath Open osthus.derykWikidataQ17489774 ScholiaQ17489774MaRDI QIDQ256989

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61473062024-01-15Paper
New bounds on the size of nearly perfect matchings in almost regular hypergraphs2023-12-19Paper
Graph and hypergraph colouring via nibble methods: a survey2023-11-10Paper
Hypergraph regularity and random sampling2023-10-23Paper
Path decompositions of tournaments2023-09-20Paper
A proof of the Erdős-Faber-Lovász conjecture2023-09-06Paper
Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor2023-08-28Paper
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹2023-04-26Paper
Counting Hamilton cycles in Dirac hypergraphs2023-03-30Paper
Extremal aspects of graph and hypergraph decomposition problems2022-11-18Paper
The minimum degree threshold for perfect graph packings2022-06-29Paper
Almost all optimally coloured complete graphs contain a rainbow Hamilton path2022-06-10Paper
Path and cycle decompositions of dense graphs2021-12-16Paper
Solution to a problem of Erd\H{o}s on the chromatic index of hypergraphs with bounded codegree2021-10-12Paper
A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree2021-09-23Paper
Resolution of the Oberwolfach problem2021-07-05Paper
Dirac’s theorem for random regular graphs2021-06-15Paper
Euler tours in hypergraphs2021-03-20Paper
Decompositions into isomorphic rainbow spanning trees2021-02-03Paper
On a conjecture of Erdős on locally sparse Steiner triple systems2020-12-18Paper
Rainbow structures in locally bounded colorings of graphs2020-10-26Paper
Minimalist designs2020-09-16Paper
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs2020-01-17Paper
Optimal packings of bounded degree trees2019-12-12Paper
On the decomposition threshold of a given graph2019-11-21Paper
Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing2019-10-25Paper
A bandwidth theorem for approximate decompositions2019-07-10Paper
A blow-up lemma for approximate decompositions2019-05-03Paper
Forbidding induced even cycles in a graph: typical structure and counting2018-05-09Paper
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths2017-11-10Paper
Hamilton cycles in graphs and hypergraphs: an extremal perspective2017-11-06Paper
Fractional clique decompositions of dense graphs and hypergraphs2017-09-29Paper
Proof of the 1-factorization and Hamilton Decomposition Conjectures2017-07-25Paper
Clique decompositions of multipartite graphs and completion of Latin squares2017-07-13Paper
A characterization of testable hypergraph properties2017-07-11Paper
Hypergraph $F$-designs for arbitrary $F$2017-06-06Paper
The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$2016-11-21Paper
Optimal path and cycle decompositions of dense quasirandom graphs2016-10-14Paper
Edge-decompositions of graphs with high minimum degree2016-10-14Paper
On the random greedy \(F\)-free hypergraph process2016-10-14Paper
Bipartitions of highly connected tournaments2016-10-14Paper
Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs2016-10-12Paper
On the Random Greedy $F$-Free Hypergraph Process2016-07-13Paper
A domination algorithm for {0,1}-instances of the travelling salesman problem2016-06-10Paper
Bipartitions of highly connected tournaments2016-05-17Paper
Optimal path and cycle decompositions of dense quasirandom graphs2016-03-14Paper
Edge-decompositions of graphs with high minimum degree2015-12-23Paper
Arbitrary Orientations of Hamilton Cycles in Digraphs2015-09-02Paper
Edge-disjoint Hamilton cycles in random graphs2015-05-29Paper
The robust component structure of dense regular graphs and applications2015-01-26Paper
Optimal covers with Hamilton cycles in random graphs2015-01-07Paper
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments2014-10-15Paper
Fractional and integer matchings in uniform hypergraphs2014-06-11Paper
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments2014-06-11Paper
https://portal.mardi4nfdi.de/entity/Q54199472014-06-11Paper
Proof of the $1$-factorization and Hamilton Decomposition Conjectures2014-06-11Paper
Decompositions of complete uniform hypergraphs into Hamilton Berge cycles2014-06-03Paper
Fractional and integer matchings in uniform hypergraphs2014-02-10Paper
Hamilton decompositions of regular expanders: applications2014-02-06Paper
Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs2014-01-21Paper
Proof of the 1-factorization and Hamilton decomposition conjectures II: the bipartite case2014-01-16Paper
Proof of the 1-factorization and Hamilton decomposition conjectures III: approximate decompositions2014-01-16Paper
Proof of the 1-factorization and Hamilton decomposition conjectures IV: exceptional systems for the two cliques case2014-01-16Paper
https://portal.mardi4nfdi.de/entity/Q28574282013-11-01Paper
https://portal.mardi4nfdi.de/entity/Q28574502013-11-01Paper
Degree sequences forcing Hamilton cycles in directed graphs2013-10-10Paper
Short cycles in oriented graphs2013-10-10Paper
Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree2013-05-13Paper
Matchings in 3-uniform hypergraphs2013-04-17Paper
Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments2013-04-16Paper
On Pósa's Conjecture for Random Graphs2013-01-04Paper
Finding Hamilton cycles in robustly expanding digraphs2012-12-04Paper
Embedding cycles of given length in oriented graphs2012-12-03Paper
Edge-disjoint Hamilton cycles in graphs2012-10-19Paper
A survey on Hamilton cycles in directed graphs2012-05-04Paper
Approximate Hamilton decompositions of random graphs2012-03-07Paper
An approximate version of Sumner's universal tournament conjecture2011-12-08Paper
A Semiexact Degree Condition for Hamilton Cycles in Digraphs2011-06-17Paper
A proof of Sumner's universal tournament conjecture for large tournaments2011-04-28Paper
Loose Hamilton cycles in hypergraphs2011-03-08Paper
Minors in random regular graphs2010-11-09Paper
An Ore-type Theorem for Perfect Packings in Graphs2010-08-27Paper
Critical chromatic number and the complexity of perfect packings in graphs2010-08-16Paper
Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs2010-08-13Paper
Hamilton \(\ell \)-cycles in uniform hypergraphs2010-08-11Paper
https://portal.mardi4nfdi.de/entity/Q35766882010-07-30Paper
https://portal.mardi4nfdi.de/entity/Q35767032010-07-30Paper
Hamilton decompositions of regular tournaments2010-07-22Paper
Hamiltonian degree sequences in digraphs2010-06-03Paper
Cycles of given length in oriented graphs2010-04-21Paper
Embedding large subgraphs into dense graphs2010-01-13Paper
An exact minimum degree condition for Hamilton cycles in oriented graphs2009-02-06Paper
Linkedness and Ordered Cycles in Digraphs2008-12-11Paper
A simple solution to Ulam's liar game with one lie2008-11-05Paper
A Dirac-Type Result on Hamilton Cycles in Oriented Graphs2008-10-13Paper
The order of the largest complete minor in a random graph2008-09-04Paper
Ramsey numbers of sparse hypergraphs2008-06-05Paper
The order of the largest complete minor in a random graph2008-06-05Paper
A minimum degree condition forcing a digraph to be k-linked2008-06-05Paper
3-uniform hypergraphs of bounded degree have linear Ramsey numbers2008-04-28Paper
Perfect packings with complete graphs minus an edge2007-11-21Paper
Maximizing Several Cuts Simultaneously2007-07-30Paper
Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs2007-05-22Paper
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree2007-01-16Paper
Improved Bounds for Topological Cliques in Graphs of Large Girth2006-06-01Paper
Matchings in hypergraphs of large minimum degree2006-05-16Paper
The minimum degree threshold for perfect graph packings2006-03-28Paper
Extremal connectivity for topological cliques in bipartite graphs2006-01-10Paper
Large planar subgraphs in dense graphs2005-11-22Paper
Spanning triangulations in graphs2005-08-01Paper
Complete minors in \(K_{s,s}\)-free graphs2005-07-05Paper
Packings in Dense Regular Graphs2005-06-07Paper
Four-cycles in graphs without a given even cycle2005-04-21Paper
Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree2005-02-14Paper
Forcing unbalanced complete bipartite minors2005-01-11Paper
Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree2004-10-19Paper
Subdivisions of $K_{r+2}$ in Graphs of Average Degree at Least $r+\varepsilon$ and Large but Constant Girth2004-09-24Paper
For which densities are random triangle-free graphs almost surely bipartite?2004-09-07Paper
Large Topological Cliques in Graphs Without a 4-Cycle2004-09-07Paper
Popularity based random graph models leading to a scale-free degree sequence2004-08-06Paper
Partitions of graphs with high minimum degree or connectivity.2003-08-25Paper
On random planar graphs, the number of planar graphs and their triangulations2003-08-25Paper
Topological minors in graphs of large girth2003-08-20Paper
https://portal.mardi4nfdi.de/entity/Q44119322003-07-10Paper
Minors in graphs of large girth2003-04-03Paper
Almost all graphs with high girth and suitable density have high chromatic number2002-09-11Paper
Random maximalH-free graphs2001-08-30Paper
Maximum antichains in random subsets of a finite set2000-11-29Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Deryk Osthus