Oliver Cooley

Generating author description...

All published works

Action	Title	Year	Authors
+	Partitioning problems via random processes	2024	Michael Anastos Oliver Cooley Mihyun Kang Matthew Kwan
+	Partitioning problems via random processes	2023	Michael Anastos Oliver Cooley Mihyun Kang Matthew Kwan
+ PDF Chat	Loose Cores and Cycles in Random Hypergraphs	2022	Oliver Cooley Mihyun Kang Julian Zalla
+ PDF Chat	On a question of Vera T. Sós about size forcing of graphons	2022	Oliver Cooley Mihyun Kang Oleg Pikhurko
+ PDF Chat	Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes	2022	Oliver Cooley N Giudice Mihyun Kang Philipp Sprüssel
+	The Sparse Parity Matrix	2022	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Joon Lee Jean Bernoulli Ravelomanana
+	High-order bootstrap percolation in hypergraphs	2022	Oliver Cooley Julian Zalla
+	The emergence of a giant rainbow component	2022	Oliver Cooley Tuan Anh Do Joshua Erde Michael Missethan
+	Warning Propagation: stability and subcriticality	2021	Oliver Cooley Joon Lee Jean Bernoulli Ravelomanana
+ PDF Chat	Warning Propagation: stability and subcriticality	2021	Oliver Cooley Joon Lee Jean Bernoulli Ravelomanana
+	The sparse parity matrix	2021	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Joon Lee Jean Bernoulli Ravelomanana
+ PDF Chat	Loose Cores and Cycles in Random Hypergraphs	2021	Oliver Cooley Mihyun Kang Julian Zalla
+	Warning Propagation on random graphs	2021	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Joon Lee Jean Bernoulli Ravelomanana
+ PDF Chat	Large Induced Matchings in Random Graphs	2021	Oliver Cooley Nemanja Draganić Mihyun Kang Benny Sudakov
+ PDF Chat	On a Question of Vera T. Sós About Size Forcing of Graphons	2021	Oliver Cooley Mihyun Kang Oleg Pikhurko
+	Paths, cycles and sprinkling in random hypergraphs	2021	Oliver Cooley
+ PDF Chat	Longest Paths in Random Hypergraphs	2021	Oliver Cooley Frederik Garbe Eng Keat Hng Mihyun Kang Nicolás Sanhueza‐Matamala Julian Zalla
+	On a question of Vera T. Sós about size forcing of graphons	2021	Oliver Cooley Mihyun Kang Oleg Pikhurko
+	Loose cores and cycles in random hypergraphs	2021	Oliver Cooley Mihyun Kang Julian Zalla
+	The sparse parity matrix	2021	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Joon Lee Jean Bernoulli Ravelomanana
+	Warning Propagation: stability and subcriticality	2021	Oliver Cooley Joon Lee Jean Bernoulli Ravelomanana
+	Phase transition in cohomology groups of non-uniform random simplicial complexes	2020	Oliver Cooley Nicola Del Giudice Mihyun Kang Philipp Sprüssel
+	Large induced matchings in random graphs	2020	Oliver Cooley Nemanja Draganić Mihyun Kang Benny Sudakov
+	Longest paths in random hypergraphs	2020	Oliver Cooley Frederik Garbe Eng Keat Hng Mihyun Kang Nicolás Sanhueza‐Matamala Julian Zalla
+ PDF Chat	Subcritical Random Hypergraphs, High-Order Components, and Hypertrees	2020	Oliver Cooley Wenjie Fang Nicola Del Giudice Mihyun Kang
+ PDF Chat	Multi-coloured jigsaw percolation on random graphs	2020	Oliver Cooley Abraham Gutiérrez
+	Large induced matchings in random graphs	2020	Oliver Cooley Nemanja Draganić Mihyun Kang Benny Sudakov
+	Longest paths in random hypergraphs	2020	Oliver Cooley Frederik Garbe Eng Keat Hng Mihyun Kang Nicolás Sanhueza‐Matamala Julian Zalla
+	Phase transition in cohomology groups of non-uniform random simplicial complexes	2020	Oliver Cooley N Giudice Mihyun Kang Philipp Sprüssel
+	Cohomology groups of non-uniform random simplicial complexes	2019	Oliver Cooley Nicola Del Giudice Mihyun Kang Philipp Sprüssel
+ PDF Chat	The Size of the Giant Component in Random Hypergraphs: a Short Proof	2019	Oliver Cooley Mihyun Kang Christoph Koch
+ PDF Chat	The sharp threshold for jigsaw percolation in random graphs	2019	Oliver Cooley Tobias Kapetanopoulos Tamás Makai
+ PDF Chat	Vanishing of cohomology groups of random simplicial complexes	2019	Oliver Cooley Nicola Del Giudice Mihyun Kang Philipp Sprüssel
+	Core forging and local limit theorems for the k-core of random graphs	2019	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Kathrin Skubch
+ PDF Chat	Subcritical random hypergraphs, high-order components, and hypertrees	2019	Oliver Cooley Wenjie Fang Nicola Del Giudice Mihyun Kang
+	Vanishing of cohomology groups of random simplicial complexes	2018	Oliver Cooley Nicola Del Giudice Mihyun Kang Philipp Sprüssel
+ PDF Chat	Largest Components in Random Hypergraphs	2018	Oliver Cooley Mihyun Kang Yury Person
+	The size of the giant component in random hypergraphs: a short proof	2018	Oliver Cooley Mihyun Kang Christoph Koch
+ PDF Chat	The size of the giant high‐order component in random hypergraphs	2018	Oliver Cooley Mihyun Kang Christof Koch
+	Vanishing of Cohomology Groups of Random Simplicial Complexes (Keynote Speakers).	2018	Oliver Cooley Nicola Del Giudice Mihyun Kang Philipp Sprüssel
+	Subcritical random hypergraphs, high-order components, and hypertrees	2018	Oliver Cooley Wenjie Fang Nicola Del Giudice Mihyun Kang
+	Vanishing of cohomology groups of random simplicial complexes	2018	Oliver Cooley N Giudice Mihyun Kang Philipp Sprüssel
+	The size of the giant component in random hypergraphs: a short proof	2018	Oliver Cooley Mihyun Kang Christof Koch
+	Multi-coloured jigsaw percolation on random graphs	2017	Oliver Cooley Abraham Gutiérrez
+ PDF Chat	Jigsaw percolation on random hypergraphs	2017	Béla Bollobás Oliver Cooley Mihyun Kang Christof Koch
+	Homological connectedness of random hypergraphs	2017	Oliver Cooley Penny Haxell Mihyun Kang Philipp Sprüssel
+	Core forging and local limit theorems for the k-core of random graphs	2017	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Kathrin Skubch
+ PDF Chat	How does the core sit inside the mantle?	2017	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Kathrin Skubch
+	The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph	2017	Oliver Cooley Richard Mycroft
+	Tight cycles and regular slices in dense hypergraphs	2017	Peter Allen Julia Böttcher Oliver Cooley Richard Mycroft
+ PDF Chat	None	2017	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Kathrin Skubch
+	Multi-coloured jigsaw percolation on random graphs	2017	Oliver Cooley Abraham Gutiérrez
+	Core forging and local limit theorems for the k-core of random graphs	2017	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Kathrin Skubch
+	The minimum vertex degree for an almost-spanning tight cycle in a $3$-uniform hypergraph	2016	Oliver Cooley Richard Mycroft
+ PDF Chat	Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs	2016	Oliver Cooley Mihyun Kang Christoph Koch
+	Homological connectivity of random hypergraphs	2016	Oliver Cooley Penny Haxell Mihyun Kang Philipp Sprüssel
+	Jigsaw percolation on random hypergraphs	2016	Béla Bollobás Oliver Cooley Mihyun Kang Christoph Koch
+	Homological connectivity of random hypergraphs	2016	Oliver Cooley Penny Haxell Mihyun Kang Philipp Sprüssel
+	The minimum vertex degree for an almost-spanning tight cycle in a $3$-uniform hypergraph	2016	Oliver Cooley Richard Mycroft
+	Jigsaw percolation on random hypergraphs	2016	Béla Bollobás Oliver Cooley Mihyun Kang Christof Koch
+ PDF Chat	Tight Cycles in Hypergraphs	2015	Peter J. Allen Julia Böttcher Oliver Cooley Richard Mycroft
+ PDF Chat	Regular slices for hypergraphs	2015	Peter Allen Julia Böttcher Oliver Cooley Richard Mycroft
+ PDF Chat	Evolution of high-order connected components in random hypergraphs	2015	Oliver Cooley Mihyun Kang Christoph Koch
+ PDF Chat	How does the core sit inside the mantle?	2015	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Kathrin Skubch
+	The minimum bisection in the planted bisection model	2015	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Kathrin Skubch
+	The Minimum Bisection in the Planted Bisection Model	2015	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Kathrin Skubch
+	How does the core sit inside the mantle	2015	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Kathrin Skubch
+	The size of the giant component in random hypergraphs	2015	Oliver Cooley Mihyun Kang Christoph Koch
+	Threshold and hitting time for high-order connectivity in random hypergraphs	2015	Oliver Cooley Mihyun Kang Christoph Koch
+	How does the core sit inside the mantle?	2015	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Kathrin Skubch
+	The minimum bisection in the planted bisection model	2015	Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Kathrin Skubch
+	Largest components in random hypergraphs	2014	Oliver Cooley Mihyun Kang Yury Person
+	Tight cycles and regular slices in dense hypergraphs	2014	Peter Allen Julia Böttcher Oliver Cooley Richard Mycroft
+	Tight cycles and regular slices in dense hypergraphs	2014	Peter J. Allen Julia Böttcher Oliver Cooley Richard Mycroft
+	Largest components in random hypergraphs	2014	Oliver Cooley Mihyun Kang Yury Person
+	Embedding Problems for Graphs and Hypergraphs	2010	Oliver Cooley
+	Minimum degree conditions for large subgraphs	2009	Peter Allen Julia Böttcher Jan Hladký Oliver Cooley
+	Proof of the Loebl–Komlós–Sós conjecture for large, dense graphs	2009	Oliver Cooley
+ PDF Chat	Loebl-Komlós-Sós Conjecture: dense case	2009	Oliver Cooley Jan Hladký Diana Piguet
+	Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs	2009	Oliver Cooley Nikolaos Fountoulakis Daniela Kühn Deryk Osthus
+ PDF Chat	3-Uniform hypergraphs of bounded degree have linear Ramsey numbers	2007	Oliver Cooley Nikolaos Fountoulakis Daniela Kühn Deryk Osthus
+	Ramsey numbers of sparse hypergraphs	2007	Daniela Kühn Oliver Cooley Nikolaos Fountoulakis Deryk Osthus
+	Perfect packings with complete graphs minus an edge	2007	Oliver Cooley Daniela Kühn Deryk Osthus
+	3-Uniform hypergraphs of bounded degree have linear Ramsey numbers	2006	Oliver Cooley Nikolaos Fountoulakis Daniela Kühn Deryk Osthus
+	Embeddings and Ramsey numbers of sparse k-uniform hypergraphs	2006	Oliver Cooley Nikolaos Fountoulakis Daniela Kühn Deryk Osthus
+	Perfect packings with complete graphs minus an edge	2006	Oliver Cooley Daniela Kühn Deryk Osthus

Common Coauthors

Coauthor	Papers Together
Mihyun Kang	57
Amin Coja‐Oghlan	15
Philipp Sprüssel	11
Kathrin Skubch	11
Nicola Del Giudice	8
Richard Mycroft	8
Deryk Osthus	7
Jean Bernoulli Ravelomanana	7
Daniela Kühn	7
Christoph Koch	7
Julian Zalla	7
Julia Böttcher	6
Joon Lee	6
Nikolaos Fountoulakis	5
Christof Koch	4
Peter Allen	4
Nicolás Sanhueza‐Matamala	3
Wenjie Fang	3
Béla Bollobás	3
Benny Sudakov	3
Frederik Garbe	3
Penny Haxell	3
Abraham Gutiérrez	3
Oleg Pikhurko	3
Yury Person	3
N Giudice	3
Eng Keat Hng	3
Nemanja Draganić	3
Peter J. Allen	2
Jan Hladký	2
Michael Anastos	2
Matthew Kwan	1
Diana Piguet	1
Tuan Anh Do	1
Matthew Kwan	1
Joon Lee	1
Tobias Kapetanopoulos	1
Joshua Erde	1
Michael Missethan	1
Tamás Makai	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Component structure in the evolution of random hypergraphs	1985	Jeanette Schmidt‐Pruzan Eli Shamir	15
+ PDF Chat	Asymptotic normality of the size of the giant component in a random hypergraph	2012	Béla Bollobás Oliver Riordan	14
+ PDF Chat	Largest Components in Random Hypergraphs	2018	Oliver Cooley Mihyun Kang Yury Person	11
+ PDF Chat	Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs	2016	Oliver Cooley Mihyun Kang Christoph Koch	10
+ PDF Chat	The size of the giant high‐order component in random hypergraphs	2018	Oliver Cooley Mihyun Kang Christof Koch	10
+	Local Limit Theorems for the Giant Component of Random Hypergraphs	2014	Michael Behrisch Amin Coja‐Oghlan Mihyun Kang	10
+ PDF Chat	On the Strength of Connectedness of a Random Hypergraph	2015	Daniel Poole	10
+ PDF Chat	Homological Connectivity Of Random 2-Complexes	2006	Nathan Linial Roy Meshulam	9
+	Sudden Emergence of a Giantk-Core in a Random Graph	1996	Boris Pittel Joel Spencer Nicholas Wormald	8
+ PDF Chat	Exploring hypergraphs with martingales	2016	Béla Bollobás Oliver Riordan	8
+	None	2004	Tom Bohman Alan Frieze Nicholas Wormald	8
+	Random Graphs of Small Order	1985	Béla Bollobás Andrew Thomason	8
+ PDF Chat	Asymptotic normality of the k-core in random graphs	2008	Svante Janson Malwina Luczak	7
+ PDF Chat	The phase transition in random graphs: A simple proof	2012	Michael Krivelevich Benny Sudakov	7
+ PDF Chat	Regular Partitions of Hypergraphs: Counting Lemmas	2007	Vojtěch Rödl Mathias Schacht	7
+	None	2010		7
+ PDF Chat	Regular Partitions of Hypergraphs: Regularity Lemmas	2007	Vojtěch Rödl Mathias Schacht	7
+	None	2006	Tom Bohman Alan Frieze Ryan R. Martin Miklós Ruszinkó Clifford Smyth	7
+ PDF Chat	The<i>k</i>-Core and Branching Processes	2007	Oliver Riordan	7
+ PDF Chat	Inside the critical window for cohomology of random <i>k</i> -complexes	2015	Matthew Kahle Boris Pittel	7
+ PDF Chat	The order of the giant component of random hypergraphs	2009	Michael Behrisch Amin Coja‐Oghlan Mihyun Kang	6
+	The phase transition in a random hypergraph	2002	Michał Karoński Tomasz Łuczak	6
+ PDF Chat	On the phase transition in random simplicial complexes	2016	Nathan Linial Yuval Peled	6
+	The set of solutions of random XORSAT formulae	2015	Morteza Ibrahimi Yash Kanoria Matt Kraning Andrea Montanari	6
+ PDF Chat	Poisson cloning model for random graphs	2007	Jeong Han Kim	6
+	Component behavior near the critical point of the random graph process	1990	Tomasz Łuczak	6
+ PDF Chat	Hypergraph regularity and the multidimensional Szemerédi theorem	2007	William Timothy Gowers	6
+	The evolution of random graphs	1984	Béla Bollobás	6
+	The Ramsey number for hypergraph cycles I	2005	Penny Haxell Tomasz Łuczak Yuejian Peng V. Rödl Andrzej Ruciński Miklós Simonovits Jozef Skokan	5
+	Topology of random clique complexes	2008	Matthew Kahle	5
+ PDF Chat	Finite size scaling for the core of large random hypergraphs	2008	Amir Dembo Andrea Montanari	5
+	Cycles in a random graph near the critical point	1991	Tomasz Łuczak	5
+	The longest path in a random graph	1981	Miklós Ajtai János Komlós Endre Szemerédi	5
+	The cores of random hypergraphs with a given degree sequence	2004	Colin Cooper	5
+ PDF Chat	An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph	2013	Graeme Kemkes Nicholas Wormald	5
+ PDF Chat	Differential equation approximations for Markov chains	2008	R. W. R. Darling James R. Norris	5
+	Tight cycles and regular slices in dense hypergraphs	2017	Peter Allen Julia Böttcher Oliver Cooley Richard Mycroft	5
+	The size of the giant component in random hypergraphs	2015	Oliver Cooley Mihyun Kang Christoph Koch	5
+	The counting lemma for regular k-uniform hypergraphs	2006	Brendan Nagle Vojtěch Rödl Mathias Schacht	5
+	An approximate Dirac-type theorem for k-uniform hypergraphs	2008	Vojtěch Rödl Endre Szemerédi Andrzej Ruciński	4
+ PDF Chat	Fundamental groups of clique complexes of random graphs	2015	A. Costa Michael Färber Danijela Horak	4
+	On Ramsey numbers of uniform hypergraphs with given maximum degree	2006	Alexandr Kostochka V. Rödl	4
+	On the robustness of random<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-cores	2014	Cristiane M. Sato	4
+	Linear Ramsey Numbers for Bounded-Degree Hypergrahps	2007	Yoshiyasu Ishigami	4
+	The Threshold for Jigsaw Percolation on Random Graphs	2017	Béla Bollobás Oliver Riordan Erik Slivken Paul Smith	4
+ PDF Chat	Sharp vanishing thresholds for cohomology of random flag complexes	2014	Matthew Kahle	4
+	Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs	2011	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi	4
+	The Blow-up Lemma	1999	János Komlós	4
+	Regularity Lemma for k‐uniform hypergraphs	2004	Vojtěch Rödl Jozef Skokan	4
+	The neighborhood complex of a random graph	2006	Matthew Kahle	4