Oliver Cooley - RankMe

37 papers A* 1C 1Journal 33Unranked 2

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