Perfect packings with complete graphs minus an edge. - Oliver Cooley; Daniela Kühn; Deryk Osthus (Eur. J. Comb., 2007)

Ramsey numbers of sparse hypergraphs. - Daniela Kühn; Oliver Cooley; Nikolaos Fountoulakis; Deryk Osthus (Electron. Notes Discret. Math., 2007)

3-Uniform hypergraphs of bounded degree have linear Ramsey numbers. - Oliver Cooley; Nikolaos Fountoulakis; Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2008)

Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs. - Oliver Cooley; Nikolaos Fountoulakis; Daniela Kühn; Deryk Osthus (Comb., 2009)

Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs. - Oliver Cooley (Discret. Math., 2009)

Minimum degree conditions for large subgraphs. - Peter Allen 001; Julia Böttcher; Jan Hladký; Oliver Cooley (Electron. Notes Discret. Math., 2009)

Loebl-Komlós-Sós Conjecture: dense case. - Oliver Cooley; Jan Hladký; Diana Piguet (Electron. Notes Discret. Math., 2009)

Tight Cycles in Hypergraphs. - Peter Allen 001; Julia Böttcher; Oliver Cooley; Richard Mycroft (Electron. Notes Discret. Math., 2015)

Regular slices for hypergraphs. - Peter Allen 001; Julia Böttcher; Oliver Cooley; Richard Mycroft (Electron. Notes Discret. Math., 2015)

How does the core sit inside the mantle? - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Kathrin Skubch (Electron. Notes Discret. Math., 2015)

Evolution of high-order connected components in random hypergraphs. - Oliver Cooley; Mihyun Kang; Christoph Koch 006 (Electron. Notes Discret. Math., 2015)

Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs. - Oliver Cooley; Mihyun Kang; Christoph Koch 006 (Electron. J. Comb., 2016)

Core forging and local limit theorems for the k-core of random graphs. - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Kathrin Skubch (CoRR, 2017)

The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph. - Oliver Cooley; Richard Mycroft (Discret. Math., 2017)

Homological connectedness of random hypergraphs. - Oliver Cooley; Penny Haxell; Mihyun Kang; Philipp Sprüssel (Electron. Notes Discret. Math., 2017)

Jigsaw percolation on random hypergraphs. - Béla Bollobás; Oliver Cooley; Mihyun Kang; Christoph Koch 006 (J. Appl. Probab., 2017)

Tight cycles and regular slices in dense hypergraphs. - Peter Allen 001; Julia Böttcher; Oliver Cooley; Richard Mycroft (J. Comb. Theory A, 2017)

The Minimum Bisection in the Planted Bisection Model. - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Kathrin Skubch (Theory Comput., 2017)

Vanishing of Cohomology Groups of Random Simplicial Complexes (Keynote Speakers). - Oliver Cooley; Nicola Del Giudice 001; Mihyun Kang; Philipp Sprüssel (AofA, 2018)

Largest Components in Random Hypergraphs. - Oliver Cooley; Mihyun Kang; Yury Person (Comb. Probab. Comput., 2018)

The size of the giant high-order component in random hypergraphs. - Oliver Cooley; Mihyun Kang; Christoph Koch 006 (Random Struct. Algorithms, 2018)

The Size of the Giant Component in Random Hypergraphs: a Short Proof. - Oliver Cooley; Mihyun Kang; Christoph Koch 006 (Electron. J. Comb., 2019)

Core forging and local limit theorems for the k-core of random graphs. - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Kathrin Skubch (J. Comb. Theory B, 2019)

Vanishing of cohomology groups of random simplicial complexes. - Oliver Cooley; Nicola Del Giudice 001; Mihyun Kang; Philipp Sprüssel (Random Struct. Algorithms, 2020)

Subcritical Random Hypergraphs, High-Order Components, and Hypertrees. - Oliver Cooley; Wenjie Fang; Nicola Del Giudice 001; Mihyun Kang (SIAM J. Discret. Math., 2020)

Large Induced Matchings in Random Graphs. - Oliver Cooley; Nemanja Draganic; Mihyun Kang; Benny Sudakov (SIAM J. Discret. Math., 2021)

Longest Paths in Random Hypergraphs. - Oliver Cooley; Frederik Garbe; Eng Keat Hng; Mihyun Kang; Nicolás Sanhueza-Matamala; Julian Zalla (SIAM J. Discret. Math., 2021)

The Sparse Parity Matrix. - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Joon Lee; Jean Bernoulli Ravelomanana (SODA, 2022)

Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes. - Oliver Cooley; Nicola Del Giudice 001; Mihyun Kang; Philipp Sprüssel (Electron. J. Comb., 2022)

Loose Cores and Cycles in Random Hypergraphs. - Oliver Cooley; Mihyun Kang; Julian Zalla (Electron. J. Comb., 2022)

The emergence of a giant rainbow component. - Oliver Cooley; Tuan Anh Do; Joshua Erde; Michael Missethan (Eur. J. Comb., 2025)