×

zbMATH — the first resource for mathematics

Osthus, Deryk

Compute Distance To:
Author ID: osthus.deryk Recent zbMATH articles by "Osthus, Deryk"
Published as: Osthus, D.; Osthus, Deryk; Osthus, Deryk Simeon
Homepage: http://web.mat.bham.ac.uk/D.Osthus/
External Links: MGP · Wikidata · dblp · GND
Documents Indexed: 109 Publications since 2000, including 2 Books
Biographic References: 1 Publication

Publications by Year

Citations contained in zbMATH Open

87 Publications have been cited 917 times in 476 Documents Cited by Year
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. Zbl 1109.05065
Kühn, Daniela; Osthus, Deryk
58
2006
Embedding large subgraphs into dense graphs. Zbl 1182.05098
Kühn, Daniela; Osthus, Deryk
52
2009
Matchings in 3-uniform hypergraphs. Zbl 1262.05128
Kühn, Daniela; Osthus, Deryk; Treglown, Andrew
40
2013
Matchings in hypergraphs of large minimum degree. Zbl 1087.05041
Kühn, Daniela; Osthus, Deryk
40
2006
Hamilton decompositions of regular expanders: A proof of Kelly’s conjecture for large tournaments. Zbl 1261.05053
Kühn, Daniela; Osthus, Deryk
38
2013
Hamilton \(\ell \)-cycles in uniform hypergraphs. Zbl 1219.05107
Kühn, Daniela; Mycroft, Richard; Osthus, Deryk
33
2010
Loose Hamilton cycles in hypergraphs. Zbl 1226.05187
Keevash, Peter; Kühn, Daniela; Mycroft, Richard; Osthus, Deryk
30
2011
Edge-disjoint Hamilton cycles in random graphs. Zbl 1312.05124
Knox, Fiachra; Kühn, Daniela; Osthus, Deryk
24
2015
Hamilton decompositions of regular expanders: applications. Zbl 1282.05084
Kühn, Daniela; Osthus, Deryk
23
2014
Hamiltonian degree sequences in digraphs. Zbl 1209.05138
Kühn, Daniela; Osthus, Deryk; Treglown, Andrew
19
2010
Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs. Zbl 1212.05170
Cooley, Oliver; Fountoulakis, Nikolaos; Kühn, Daniela; Osthus, Deryk
18
2009
An exact minimum degree condition for Hamilton cycles in oriented graphs. Zbl 1198.05081
Keevash, Peter; Kühn, Daniela; Osthus, Deryk
18
2009
Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree. Zbl 1056.05082
Kühn, Daniela; Osthus, Deryk
18
2004
Hamilton cycles in graphs and hypergraphs: an extremal perspective. Zbl 1373.05100
Kühn, Daniela; Osthus, Deryk
17
2014
Forcing unbalanced complete bipartite minors. Zbl 1061.05087
Kühn, Daniela; Osthus, Deryk
17
2005
Popularity based random graph models leading to a scale-free degree sequence. Zbl 1042.05089
Buckley, Pierce G.; Osthus, Deryk
17
2004
Random maximal \(H\)-free graphs. Zbl 0967.05060
Osthus, Deryk; Taraz, Anusch
17
2001
Edge-decompositions of graphs with high minimum degree. Zbl 1328.05145
Barber, Ben; Kühn, Daniela; Lo, Allan; Osthus, Deryk
15
2016
A survey on Hamilton cycles in directed graphs. Zbl 1239.05114
Kühn, Daniela; Osthus, Deryk
14
2012
Fractional and integer matchings in uniform hypergraphs. Zbl 1282.05172
Kühn, Daniela; Osthus, Deryk; Townsend, Timothy
13
2014
Edge-disjoint Hamilton cycles in graphs. Zbl 1251.05091
Christofides, Demetres; Kühn, Daniela; Osthus, Deryk
13
2012
3-uniform hypergraphs of bounded degree have linear Ramsey numbers. Zbl 1140.05045
Cooley, Oliver; Fountoulakis, Nikolaos; Kühn, Daniela; Osthus, Deryk
13
2008
Large planar subgraphs in dense graphs. Zbl 1075.05045
Kühn, Daniela; Osthus, Deryk; Taraz, Anusch
12
2005
On random planar graphs, the number of planar graphs and their triangulations. Zbl 1030.05108
Osthus, Deryk; Prömel, Hans Jürgen; Taraz, Anusch
12
2003
Partitions of graphs with high minimum degree or connectivity. Zbl 1045.05075
Kühn, Daniela; Osthus, Deryk
12
2003
Proof of the 1-factorization and Hamilton decomposition conjectures. Zbl 1367.05165
Csaba, Béla; Kühn, Daniela; Lo, Allan; Osthus, Deryk; Treglown, Andrew
11
2016
An Ore-type theorem for perfect packings in graphs. Zbl 1207.05059
Kühn, Daniela; Osthus, Deryk; Treglown, Andrew
11
2009
For which densities are random triangle-free graphs almost surely bipartite? Zbl 1047.05040
Osthus, D.; Prömel, H. J.; Taraz, A.
11
2003
Minors in graphs of large girth. Zbl 1015.05085
Kühn, Daniela; Osthus, Deryk
11
2003
Clique decompositions of multipartite graphs and completion of Latin squares. Zbl 1366.05018
Barber, Ben; Kühn, Daniela; Lo, Allan; Osthus, Deryk; Taylor, Amelia
10
2017
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments. Zbl 1302.05069
Kühn, Daniela; Lapinskas, John; Osthus, Deryk; Patel, Viresh
10
2014
On Pósa’s conjecture for random graphs. Zbl 1256.05224
Kühn, Daniela; Osthus, Deryk
10
2012
A proof of Sumner’s universal tournament conjecture for large tournaments. Zbl 1218.05034
Kühn, Daniela; Mycroft, Richard; Osthus, Deryk
10
2011
Hamilton decompositions of regular tournaments. Zbl 1221.05179
Kühn, Daniela; Osthus, Deryk; Treglown, Andrew
10
2010
Topological minors in graphs of large girth. Zbl 1026.05063
Kühn, Daniela; Osthus, Deryk
10
2002
Optimal packings of Hamilton cycles in graphs of high minimum degree. Zbl 1269.05068
Kühn, Daniela; Lapinskas, John; Osthus, Deryk
9
2013
Multicolored Hamilton cycles and perfect matchings in pseudorandom graphs. Zbl 1117.05071
Kühn, Daniela; Osthus, Deryk
9
2006
Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree. Zbl 1047.05022
Kühn, D.; Osthus, D.
9
2004
Fractional clique decompositions of dense graphs and hypergraphs. Zbl 1371.05226
Barber, Ben; Kühn, Daniela; Lo, Allan; Montgomery, Richard; Osthus, Deryk
8
2017
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths. Zbl 1389.05058
Kühn, Daniela; Osthus, Deryk; Townsend, Timothy
8
2016
A Dirac-type result on Hamilton cycles in oriented graphs. Zbl 1172.05038
Kelly, Luke; Kühn, Daniela; Osthus, Deryk
8
2008
Critical chromatic number and the complexity of perfect packings in graphs. Zbl 1192.05053
Kühn, Daniela; Osthus, Deryk
8
2006
A blow-up lemma for approximate decompositions. Zbl 1409.05114
Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk; Tyomkyn, Mykhaylo
7
2019
Decompositions of complete uniform hypergraphs into Hamilton Berge cycles. Zbl 1295.05168
Kühn, Daniela; Osthus, Deryk
7
2014
Proof of the 1-factorization and Hamilton decomposition conjectures. Zbl 1291.05154
Csaba, Béla; Kühn, Daniela; Lo, Allan; Osthus, Deryk; Treglown, Andrew
7
2013
Approximate Hamilton decompositions of random graphs. Zbl 1236.05181
Knox, Fiachra; Kühn, Daniela; Osthus, Deryk
7
2012
An approximate version of Sumner’s universal tournament conjecture. Zbl 1234.05115
Kühn, Daniela; Mycroft, Richard; Osthus, Deryk
7
2011
Spanning triangulations in graphs. Zbl 1066.05057
Kühn, Daniela; Osthus, Deryk
7
2005
Four-cycles in graphs without a given even cycle. Zbl 1061.05048
Kühn, Daniela; Osthus, Deryk
7
2005
Optimal packings of bounded degree trees. Zbl 1429.05164
Joos, Felix; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk
6
2019
Optimal path and cycle decompositions of dense quasirandom graphs. Zbl 1332.05078
Glock, Stefan; Kühn, Daniela; Osthus, Deryk
6
2016
Finding Hamilton cycles in robustly expanding digraphs. Zbl 1254.05090
Christofides, Demetres; Keevash, Peter; Kühn, Daniela; Osthus, Deryk
6
2012
Optimal covers with Hamilton cycles in random graphs. Zbl 1340.05153
Hefetz, Dan; Kühn, Daniela; Lapinskas, John; Osthus, Deryk
5
2014
The order of the largest complete minor in a random graph. Zbl 1230.05261
Fountoulakis, Nikolaos; Kühn, Daniela; Osthus, Deryk
5
2008
Maximizing several cuts simultaneously. Zbl 1122.05082
Kühn, Daniela; Osthus, Deryk
5
2007
Improved bounds for topological cliques in graphs of large girth. Zbl 1111.05091
Kühn, Daniela; Osthus, Deryk
5
2006
Maximum antichains in random subsets of a finite set. Zbl 0949.05084
Osthus, Deryk
5
2000
On the decomposition threshold of a given graph. Zbl 1428.05246
Glock, Stefan; Kühn, Daniela; Lo, Allan; Montgomery, Richard; Osthus, Deryk
4
2019
A bandwidth theorem for approximate decompositions. Zbl 1415.05145
Condon, Padraig; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk
4
2019
Bipartitions of highly connected tournaments. Zbl 1336.05050
Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk
4
2016
Approximate Hamilton decompositions of robustly expanding regular digraphs. Zbl 1292.05125
Osthus, Deryk; Staden, Katherine
4
2013
Cycles of given length in oriented graphs. Zbl 1274.05257
Kelly, Luke; Kühn, Daniela; Osthus, Deryk
4
2010
Minors in random regular graphs. Zbl 1201.05086
Fountoulakis, Nikolaos; Kühn, Daniela; Osthus, Deryk
4
2009
Linkedness and ordered cycles in digraphs. Zbl 1162.05025
Kühn, Daniela; Osthus, Deryk
4
2008
Perfect packings with complete graphs minus an edge. Zbl 1136.05055
Cooley, Oliver; Kühn, Daniela; Osthus, Deryk
4
2007
Packings in dense regular graphs. Zbl 1064.05121
Kühn, Daniela; Osthus, Deryk
4
2005
The length of random subsets of Boolean lattices. Zbl 0973.60018
Kohayakawa, Y.; Kreuter, B.; Osthus, D.
4
2000
Rainbow structures in locally bounded colorings of graphs. Zbl 1450.05070
Kim, Jaehoon; Kühn, Daniela; Kupavskii, Andrey; Osthus, Deryk
3
2020
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles. Zbl 1398.05095
Kühn, Daniela; Osthus, Deryk; Townsend, Timothy; Zhao, Yi
3
2017
The robust component structure of dense regular graphs and applications. Zbl 1307.05130
Kühn, Daniela; Lo, Allan; Osthus, Deryk; Staden, Katherine
3
2015
A semiexact degree condition for Hamilton cycles in digraphs. Zbl 1223.05162
Christofides, Demetres; Keevash, Peter; Kühn, Daniela; Osthus, Deryk
3
2010
Extremal connectivity for topological cliques in bipartite graphs. Zbl 1080.05044
Kühn, Daniela; Osthus, Deryk
3
2006
Complete minors in \(K_{s,s}\)-free graphs. Zbl 1063.05123
Kühn, Daniela; Osthus, Deryk
3
2005
Large topological cliques in graphs without a 4-cycle. Zbl 1049.05074
Kühn, Daniela; Osthus, Deryk
3
2004
Forbidding induced even cycles in a graph: typical structure and counting. Zbl 1387.05168
Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk; Townsend, Timothy
2
2018
Edge-decompositions of graphs with high minimum degree. Zbl 1346.05224
Barber, Ben; Kühn, Daniela; Lo, Allan; Osthus, Deryk
2
2015
\(k\)-Ordered Hamilton cycles in digraphs. Zbl 1176.05042
Kühn, Daniela; Osthus, Deryk; Young, Andrew
2
2008
A note on complete subdivisions in digraphs of large outdegree. Zbl 1163.05019
Kühn, Daniela; Osthus, Deryk; Young, Andrew
2
2008
Subdivisions of \(K_{r+2}\) in graphs of average degree at least \(r+\varepsilon\) and large but constant girth. Zbl 1058.05041
Kühn, Daniela; Osthus, Deryk
2
2004
Euler tours in hypergraphs. Zbl 07326462
Glock, Stefan; Joos, Felix; Kühn, Daniela; Osthus, Deryk
1
2020
Minimalist designs. Zbl 1451.05159
Barber, Ben; Glock, Stefan; Kühn, Daniela; Lo, Allan; Montgomery, Richard; Osthus, Deryk
1
2020
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs. Zbl 1431.05094
Condon, Padraig; Espuny Díaz, Alberto; Kühn, Daniela; Osthus, Deryk; Kim, Jaehoon
1
2019
Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs. Zbl 1348.05118
Kühn, Daniela; Lo, Allan; Osthus, Deryk; Staden, Katherine
1
2016
A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem. Zbl 1372.90095
Kühn, Daniela; Osthus, Deryk; Patel, Viresh
1
2016
Bipartitions of highly connected tournaments. Zbl 1346.05094
Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk
1
2015
Short cycles in oriented graphs. Zbl 1273.05119
Osthus, Deryk; Kelly, Luke; Kühn, Daniela
1
2009
Matchings and Hamilton cycles in hypergraphs. Zbl 1192.05107
Kühn, Daniela; Osthus, Deryk
1
2005
Rainbow structures in locally bounded colorings of graphs. Zbl 1450.05070
Kim, Jaehoon; Kühn, Daniela; Kupavskii, Andrey; Osthus, Deryk
3
2020
Euler tours in hypergraphs. Zbl 07326462
Glock, Stefan; Joos, Felix; Kühn, Daniela; Osthus, Deryk
1
2020
Minimalist designs. Zbl 1451.05159
Barber, Ben; Glock, Stefan; Kühn, Daniela; Lo, Allan; Montgomery, Richard; Osthus, Deryk
1
2020
A blow-up lemma for approximate decompositions. Zbl 1409.05114
Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk; Tyomkyn, Mykhaylo
7
2019
Optimal packings of bounded degree trees. Zbl 1429.05164
Joos, Felix; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk
6
2019
On the decomposition threshold of a given graph. Zbl 1428.05246
Glock, Stefan; Kühn, Daniela; Lo, Allan; Montgomery, Richard; Osthus, Deryk
4
2019
A bandwidth theorem for approximate decompositions. Zbl 1415.05145
Condon, Padraig; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk
4
2019
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs. Zbl 1431.05094
Condon, Padraig; Espuny Díaz, Alberto; Kühn, Daniela; Osthus, Deryk; Kim, Jaehoon
1
2019
Forbidding induced even cycles in a graph: typical structure and counting. Zbl 1387.05168
Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk; Townsend, Timothy
2
2018
Clique decompositions of multipartite graphs and completion of Latin squares. Zbl 1366.05018
Barber, Ben; Kühn, Daniela; Lo, Allan; Osthus, Deryk; Taylor, Amelia
10
2017
Fractional clique decompositions of dense graphs and hypergraphs. Zbl 1371.05226
Barber, Ben; Kühn, Daniela; Lo, Allan; Montgomery, Richard; Osthus, Deryk
8
2017
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles. Zbl 1398.05095
Kühn, Daniela; Osthus, Deryk; Townsend, Timothy; Zhao, Yi
3
2017
Edge-decompositions of graphs with high minimum degree. Zbl 1328.05145
Barber, Ben; Kühn, Daniela; Lo, Allan; Osthus, Deryk
15
2016
Proof of the 1-factorization and Hamilton decomposition conjectures. Zbl 1367.05165
Csaba, Béla; Kühn, Daniela; Lo, Allan; Osthus, Deryk; Treglown, Andrew
11
2016
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths. Zbl 1389.05058
Kühn, Daniela; Osthus, Deryk; Townsend, Timothy
8
2016
Optimal path and cycle decompositions of dense quasirandom graphs. Zbl 1332.05078
Glock, Stefan; Kühn, Daniela; Osthus, Deryk
6
2016
Bipartitions of highly connected tournaments. Zbl 1336.05050
Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk
4
2016
Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs. Zbl 1348.05118
Kühn, Daniela; Lo, Allan; Osthus, Deryk; Staden, Katherine
1
2016
A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem. Zbl 1372.90095
Kühn, Daniela; Osthus, Deryk; Patel, Viresh
1
2016
Edge-disjoint Hamilton cycles in random graphs. Zbl 1312.05124
Knox, Fiachra; Kühn, Daniela; Osthus, Deryk
24
2015
The robust component structure of dense regular graphs and applications. Zbl 1307.05130
Kühn, Daniela; Lo, Allan; Osthus, Deryk; Staden, Katherine
3
2015
Edge-decompositions of graphs with high minimum degree. Zbl 1346.05224
Barber, Ben; Kühn, Daniela; Lo, Allan; Osthus, Deryk
2
2015
Bipartitions of highly connected tournaments. Zbl 1346.05094
Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk
1
2015
Hamilton decompositions of regular expanders: applications. Zbl 1282.05084
Kühn, Daniela; Osthus, Deryk
23
2014
Hamilton cycles in graphs and hypergraphs: an extremal perspective. Zbl 1373.05100
Kühn, Daniela; Osthus, Deryk
17
2014
Fractional and integer matchings in uniform hypergraphs. Zbl 1282.05172
Kühn, Daniela; Osthus, Deryk; Townsend, Timothy
13
2014
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments. Zbl 1302.05069
Kühn, Daniela; Lapinskas, John; Osthus, Deryk; Patel, Viresh
10
2014
Decompositions of complete uniform hypergraphs into Hamilton Berge cycles. Zbl 1295.05168
Kühn, Daniela; Osthus, Deryk
7
2014
Optimal covers with Hamilton cycles in random graphs. Zbl 1340.05153
Hefetz, Dan; Kühn, Daniela; Lapinskas, John; Osthus, Deryk
5
2014
Matchings in 3-uniform hypergraphs. Zbl 1262.05128
Kühn, Daniela; Osthus, Deryk; Treglown, Andrew
40
2013
Hamilton decompositions of regular expanders: A proof of Kelly’s conjecture for large tournaments. Zbl 1261.05053
Kühn, Daniela; Osthus, Deryk
38
2013
Optimal packings of Hamilton cycles in graphs of high minimum degree. Zbl 1269.05068
Kühn, Daniela; Lapinskas, John; Osthus, Deryk
9
2013
Proof of the 1-factorization and Hamilton decomposition conjectures. Zbl 1291.05154
Csaba, Béla; Kühn, Daniela; Lo, Allan; Osthus, Deryk; Treglown, Andrew
7
2013
Approximate Hamilton decompositions of robustly expanding regular digraphs. Zbl 1292.05125
Osthus, Deryk; Staden, Katherine
4
2013
A survey on Hamilton cycles in directed graphs. Zbl 1239.05114
Kühn, Daniela; Osthus, Deryk
14
2012
Edge-disjoint Hamilton cycles in graphs. Zbl 1251.05091
Christofides, Demetres; Kühn, Daniela; Osthus, Deryk
13
2012
On Pósa’s conjecture for random graphs. Zbl 1256.05224
Kühn, Daniela; Osthus, Deryk
10
2012
Approximate Hamilton decompositions of random graphs. Zbl 1236.05181
Knox, Fiachra; Kühn, Daniela; Osthus, Deryk
7
2012
Finding Hamilton cycles in robustly expanding digraphs. Zbl 1254.05090
Christofides, Demetres; Keevash, Peter; Kühn, Daniela; Osthus, Deryk
6
2012
Loose Hamilton cycles in hypergraphs. Zbl 1226.05187
Keevash, Peter; Kühn, Daniela; Mycroft, Richard; Osthus, Deryk
30
2011
A proof of Sumner’s universal tournament conjecture for large tournaments. Zbl 1218.05034
Kühn, Daniela; Mycroft, Richard; Osthus, Deryk
10
2011
An approximate version of Sumner’s universal tournament conjecture. Zbl 1234.05115
Kühn, Daniela; Mycroft, Richard; Osthus, Deryk
7
2011
Hamilton \(\ell \)-cycles in uniform hypergraphs. Zbl 1219.05107
Kühn, Daniela; Mycroft, Richard; Osthus, Deryk
33
2010
Hamiltonian degree sequences in digraphs. Zbl 1209.05138
Kühn, Daniela; Osthus, Deryk; Treglown, Andrew
19
2010
Hamilton decompositions of regular tournaments. Zbl 1221.05179
Kühn, Daniela; Osthus, Deryk; Treglown, Andrew
10
2010
Cycles of given length in oriented graphs. Zbl 1274.05257
Kelly, Luke; Kühn, Daniela; Osthus, Deryk
4
2010
A semiexact degree condition for Hamilton cycles in digraphs. Zbl 1223.05162
Christofides, Demetres; Keevash, Peter; Kühn, Daniela; Osthus, Deryk
3
2010
Embedding large subgraphs into dense graphs. Zbl 1182.05098
Kühn, Daniela; Osthus, Deryk
52
2009
Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs. Zbl 1212.05170
Cooley, Oliver; Fountoulakis, Nikolaos; Kühn, Daniela; Osthus, Deryk
18
2009
An exact minimum degree condition for Hamilton cycles in oriented graphs. Zbl 1198.05081
Keevash, Peter; Kühn, Daniela; Osthus, Deryk
18
2009
An Ore-type theorem for perfect packings in graphs. Zbl 1207.05059
Kühn, Daniela; Osthus, Deryk; Treglown, Andrew
11
2009
Minors in random regular graphs. Zbl 1201.05086
Fountoulakis, Nikolaos; Kühn, Daniela; Osthus, Deryk
4
2009
Short cycles in oriented graphs. Zbl 1273.05119
Osthus, Deryk; Kelly, Luke; Kühn, Daniela
1
2009
3-uniform hypergraphs of bounded degree have linear Ramsey numbers. Zbl 1140.05045
Cooley, Oliver; Fountoulakis, Nikolaos; Kühn, Daniela; Osthus, Deryk
13
2008
A Dirac-type result on Hamilton cycles in oriented graphs. Zbl 1172.05038
Kelly, Luke; Kühn, Daniela; Osthus, Deryk
8
2008
The order of the largest complete minor in a random graph. Zbl 1230.05261
Fountoulakis, Nikolaos; Kühn, Daniela; Osthus, Deryk
5
2008
Linkedness and ordered cycles in digraphs. Zbl 1162.05025
Kühn, Daniela; Osthus, Deryk
4
2008
\(k\)-Ordered Hamilton cycles in digraphs. Zbl 1176.05042
Kühn, Daniela; Osthus, Deryk; Young, Andrew
2
2008
A note on complete subdivisions in digraphs of large outdegree. Zbl 1163.05019
Kühn, Daniela; Osthus, Deryk; Young, Andrew
2
2008
Maximizing several cuts simultaneously. Zbl 1122.05082
Kühn, Daniela; Osthus, Deryk
5
2007
Perfect packings with complete graphs minus an edge. Zbl 1136.05055
Cooley, Oliver; Kühn, Daniela; Osthus, Deryk
4
2007
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. Zbl 1109.05065
Kühn, Daniela; Osthus, Deryk
58
2006
Matchings in hypergraphs of large minimum degree. Zbl 1087.05041
Kühn, Daniela; Osthus, Deryk
40
2006
Multicolored Hamilton cycles and perfect matchings in pseudorandom graphs. Zbl 1117.05071
Kühn, Daniela; Osthus, Deryk
9
2006
Critical chromatic number and the complexity of perfect packings in graphs. Zbl 1192.05053
Kühn, Daniela; Osthus, Deryk
8
2006
Improved bounds for topological cliques in graphs of large girth. Zbl 1111.05091
Kühn, Daniela; Osthus, Deryk
5
2006
Extremal connectivity for topological cliques in bipartite graphs. Zbl 1080.05044
Kühn, Daniela; Osthus, Deryk
3
2006
Forcing unbalanced complete bipartite minors. Zbl 1061.05087
Kühn, Daniela; Osthus, Deryk
17
2005
Large planar subgraphs in dense graphs. Zbl 1075.05045
Kühn, Daniela; Osthus, Deryk; Taraz, Anusch
12
2005
Spanning triangulations in graphs. Zbl 1066.05057
Kühn, Daniela; Osthus, Deryk
7
2005
Four-cycles in graphs without a given even cycle. Zbl 1061.05048
Kühn, Daniela; Osthus, Deryk
7
2005
Packings in dense regular graphs. Zbl 1064.05121
Kühn, Daniela; Osthus, Deryk
4
2005
Complete minors in \(K_{s,s}\)-free graphs. Zbl 1063.05123
Kühn, Daniela; Osthus, Deryk
3
2005
Matchings and Hamilton cycles in hypergraphs. Zbl 1192.05107
Kühn, Daniela; Osthus, Deryk
1
2005
Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree. Zbl 1056.05082
Kühn, Daniela; Osthus, Deryk
18
2004
Popularity based random graph models leading to a scale-free degree sequence. Zbl 1042.05089
Buckley, Pierce G.; Osthus, Deryk
17
2004
Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree. Zbl 1047.05022
Kühn, D.; Osthus, D.
9
2004
Large topological cliques in graphs without a 4-cycle. Zbl 1049.05074
Kühn, Daniela; Osthus, Deryk
3
2004
Subdivisions of \(K_{r+2}\) in graphs of average degree at least \(r+\varepsilon\) and large but constant girth. Zbl 1058.05041
Kühn, Daniela; Osthus, Deryk
2
2004
On random planar graphs, the number of planar graphs and their triangulations. Zbl 1030.05108
Osthus, Deryk; Prömel, Hans Jürgen; Taraz, Anusch
12
2003
Partitions of graphs with high minimum degree or connectivity. Zbl 1045.05075
Kühn, Daniela; Osthus, Deryk
12
2003
For which densities are random triangle-free graphs almost surely bipartite? Zbl 1047.05040
Osthus, D.; Prömel, H. J.; Taraz, A.
11
2003
Minors in graphs of large girth. Zbl 1015.05085
Kühn, Daniela; Osthus, Deryk
11
2003
Topological minors in graphs of large girth. Zbl 1026.05063
Kühn, Daniela; Osthus, Deryk
10
2002
Random maximal \(H\)-free graphs. Zbl 0967.05060
Osthus, Deryk; Taraz, Anusch
17
2001
Maximum antichains in random subsets of a finite set. Zbl 0949.05084
Osthus, Deryk
5
2000
The length of random subsets of Boolean lattices. Zbl 0973.60018
Kohayakawa, Y.; Kreuter, B.; Osthus, D.
4
2000
all top 5

Cited by 547 Authors

59 Osthus, Deryk
56 Kühn, Daniela
24 Sudakov, Benny
19 Han, Jie
17 Treglown, Andrew
16 Lo, Allan Siu Lun
16 Mycroft, Richard
15 Zhao, Yi
14 Rodl, Vojtech
13 Böttcher, Julia
12 Krivelevich, Michael
12 Schacht, Mathias
11 Balogh, József
10 Keevash, Peter
10 Ruciński, Andrzej
10 Szemerédi, Endre
9 Kim, Jaehoon
9 Lu, Mei
9 Taraz, Anusch
8 Bang-Jensen, Jørgen
8 Ferber, Asaf
8 Person, Yury Aleksandrovic
7 Allen, Peter M.
7 Cooley, Oliver
7 Fox, Jacob
7 Hladký, Jan
7 Markström, Klas
7 Montgomery, Richard H.
7 Staden, Katherine
7 Zhang, Yi
6 Czygrinow, Andrzej
6 Debiasio, Louis
6 Lee, Choongbum
6 Morris, Robert D.
6 Warnke, Lutz
5 Glock, Stefan
5 Kang, Mihyun
5 Kawarabayashi, Ken-ichi
5 Kohayakawa, Yoshiharu
5 Liu, Hong
5 Magnant, Colton
5 Molla, Theodore
5 Mubayi, Dhruv
5 Nagle, Brendan
5 Parczyk, Olaf
5 Patel, Viresh
5 Piguet, Diana
5 Pokrovskiy, Alexey
5 Sharifzadeh, Maryam
5 Skokan, Jozef
5 Tompkins, Casey
5 Wood, David Ronald
5 Yuster, Raphael
4 Barber, Ben
4 Fountoulakis, Nikolaos
4 Knox, Fiachra
4 Kostochka, Aleksandr Vasil’evich
4 Kwan, Matthew
4 Loh, Po-Shen
4 Lu, Hongliang
4 Mota, Guilherme Oliveira
4 Reed, Bruce Alan
4 Salehi Nowbandegani, Pouria
4 Samotij, Wojciech
4 Schnitzer, Jakob
4 Schulenburg, Fabian
4 Simonovits, Miklós
4 Sprussel, Philipp
4 Taylor, Amelia
4 Thomassen, Carsten
4 Townsend, Timothy
4 Vušković, Kristina
4 Würfl, Andreas
4 Yu, Xingxing
3 Axenovich, Maria A.
3 Casselgren, Carl Johan
3 Chandran, L. Sunil
3 Chen, Guantao
3 Chiba, Shuya
3 Conlon, David
3 Dukes, Peter James
3 Ehrenmüller, Julia
3 Frieze, Alan Michael
3 Furedi, Zoltan
3 Girão, António
3 Glebov, Roman
3 Győri, Ervin
3 Havet, Frédéric
3 Hefetz, Dan
3 Huang, Hao
3 Joos, Felix Claudius
3 Kang, Dong Yeap
3 Katona, Gyula Y.
3 Kierstead, Henry A.
3 Korándi, Dániel
3 Lapinskas, John
3 Lenz, John
3 Letzter, Shoham
3 Liu, Ke
3 Methuku, Abhishek
...and 447 more Authors
all top 5

Cited in 74 Serials

65 Journal of Combinatorial Theory. Series B
41 Combinatorics, Probability and Computing
37 Discrete Mathematics
31 SIAM Journal on Discrete Mathematics
28 European Journal of Combinatorics
25 Random Structures & Algorithms
22 Journal of Combinatorial Theory. Series A
19 Graphs and Combinatorics
17 The Electronic Journal of Combinatorics
16 Journal of Graph Theory
14 Combinatorica
11 Theoretical Computer Science
9 Discrete Applied Mathematics
7 Advances in Mathematics
5 Israel Journal of Mathematics
5 Acta Mathematica Sinica. English Series
4 Transactions of the American Mathematical Society
4 Linear Algebra and its Applications
4 Forum of Mathematics, Sigma
3 Journal of Applied Probability
3 Memoirs of the American Mathematical Society
2 Advances in Applied Probability
2 Applied Mathematics and Computation
2 Proceedings of the London Mathematical Society. Third Series
2 Discrete & Computational Geometry
2 Journal of the American Mathematical Society
2 The Australasian Journal of Combinatorics
2 Opuscula Mathematica
2 Discussiones Mathematicae. Graph Theory
2 Journal of the European Mathematical Society (JEMS)
2 Optimization Letters
2 Discrete Mathematics, Algorithms and Applications
1 Physica A
1 Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg
1 Bulletin of the London Mathematical Society
1 Commentationes Mathematicae Universitatis Carolinae
1 Inventiones Mathematicae
1 Journal of the London Mathematical Society. Second Series
1 The Journal of Symbolic Logic
1 Mathematische Annalen
1 Operations Research
1 Quaestiones Mathematicae
1 Advances in Applied Mathematics
1 Operations Research Letters
1 Annals of Pure and Applied Logic
1 Order
1 Acta Mathematicae Applicatae Sinica. English Series
1 Algorithmica
1 Applied Mathematics Letters
1 Designs, Codes and Cryptography
1 Stochastic Processes and their Applications
1 Mathematical Programming. Series A. Series B
1 Acta Universitatis Matthiae Belii. Series Mathematics
1 Journal of Combinatorial Designs
1 Electronic Journal of Probability
1 Mathematical Methods of Operations Research
1 Annals of Combinatorics
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Integers
1 Stochastics and Dynamics
1 Journal of Applied Mathematics and Computing
1 Quantum Information Processing
1 Journal of Discrete Algorithms
1 Internet Mathematics
1 Contributions to Discrete Mathematics
1 Electronic Research Announcements in Mathematical Sciences
1 Ars Mathematica Contemporanea
1 Acta Universitatis Sapientiae. Informatica
1 Algorithms
1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
1 Transactions on Combinatorics
1 Journal of the Operations Research Society of China
1 Computer Science Review
1 The Art of Discrete and Applied Mathematics

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.