Oliver Cooley

Publication Activity (10 Years)

Years Active: 2007-2022
Publications (10 Years): 21

Top Topics

Keynote Speakers

Randomly Distributed

Connected Components

Top Venues

Electron. Notes Discret. Math.

Electron. J. Comb.

SIAM J. Discret. Math.

Publications

Oliver Cooley, Mihyun Kang, Julian Zalla
Loose Cores and Cycles in Random Hypergraphs. Electron. J. Comb. 29 (4) (2022)
Oliver Cooley, Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel
Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes. Electron. J. Comb. 29 (3) (2022)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, Jean Bernoulli Ravelomanana
The Sparse Parity Matrix. SODA (2022)
Oliver Cooley, Nemanja Draganic, Mihyun Kang, Benny Sudakov
Large Induced Matchings in Random Graphs. SIAM J. Discret. Math. 35 (1) (2021)
Oliver Cooley, Frederik Garbe, Eng Keat Hng, Mihyun Kang, Nicolás Sanhueza-Matamala, Julian Zalla
Longest Paths in Random Hypergraphs. SIAM J. Discret. Math. 35 (4) (2021)
Oliver Cooley, Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel
Vanishing of cohomology groups of random simplicial complexes. Random Struct. Algorithms 56 (2) (2020)
Oliver Cooley, Wenjie Fang, Nicola Del Giudice, Mihyun Kang
Subcritical Random Hypergraphs, High-Order Components, and Hypertrees. SIAM J. Discret. Math. 34 (4) (2020)
Oliver Cooley, Mihyun Kang, Christoph Koch
The Size of the Giant Component in Random Hypergraphs: a Short Proof. Electron. J. Comb. 26 (3) (2019)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
-core of random graphs. J. Comb. Theory, Ser. B 137 (2019)
Oliver Cooley, Wenjie Fang, Nicola Del Giudice, Mihyun Kang
Subcritical random hypergraphs, high-order components, and hypertrees. ANALCO (2019)
Oliver Cooley, Mihyun Kang, Yury Person
Largest Components in Random Hypergraphs. Comb. Probab. Comput. 27 (5) (2018)
Oliver Cooley, Mihyun Kang, Christoph Koch
The size of the giant high-order component in random hypergraphs. Random Struct. Algorithms 53 (2) (2018)
Oliver Cooley, Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel
Vanishing of Cohomology Groups of Random Simplicial Complexes (Keynote Speakers). AofA (2018)
Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft
Tight cycles and regular slices in dense hypergraphs. J. Comb. Theory, Ser. A 149 (2017)
Oliver Cooley, Richard Mycroft
The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph. Discret. Math. 340 (6) (2017)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
Core forging and local limit theorems for the k-core of random graphs. CoRR (2017)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
The Minimum Bisection in the Planted Bisection Model. Theory Comput. 13 (1) (2017)
Oliver Cooley, Penny Haxell, Mihyun Kang, Philipp Sprüssel
Homological connectedness of random hypergraphs. Electron. Notes Discret. Math. 61 (2017)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
How does the core sit inside the mantle? Random Struct. Algorithms 51 (3) (2017)
Béla Bollobás, Oliver Cooley, Mihyun Kang, Christoph Koch
Jigsaw percolation on random hypergraphs. J. Appl. Probab. 54 (4) (2017)
Oliver Cooley, Mihyun Kang, Christoph Koch
Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs. Electron. J. Comb. 23 (2) (2016)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
The minimum bisection in the planted bisection model. CoRR (2015)
Oliver Cooley, Mihyun Kang, Christoph Koch
Evolution of high-order connected components in random hypergraphs. Electron. Notes Discret. Math. 49 (2015)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
How does the core sit inside the mantle? Electron. Notes Discret. Math. 49 (2015)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
How does the core sit inside the mantle? CoRR (2015)
Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft
Tight Cycles in Hypergraphs. Electron. Notes Discret. Math. 49 (2015)
Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft
Regular slices for hypergraphs. Electron. Notes Discret. Math. 49 (2015)
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch
The Minimum Bisection in the Planted Bisection Model. APPROX-RANDOM (2015)
Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
-uniform hypergraphs. Comb. 29 (3) (2009)
Oliver Cooley, Jan Hladký, Diana Piguet
Loebl-Komlós-Sós Conjecture: dense case. Electron. Notes Discret. Math. 34 (2009)
Oliver Cooley
Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs. Discret. Math. 309 (21) (2009)
Peter Allen, Julia Böttcher, Jan Hladký, Oliver Cooley
Minimum degree conditions for large subgraphs. Electron. Notes Discret. Math. 34 (2009)
Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers. J. Comb. Theory, Ser. B 98 (3) (2008)
Oliver Cooley, Daniela Kühn, Deryk Osthus
Perfect packings with complete graphs minus an edge. Eur. J. Comb. 28 (8) (2007)
Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus
Ramsey numbers of sparse hypergraphs. Electron. Notes Discret. Math. 29 (2007)