Oliver Cooley

From MaRDI portal
Person:322302

Available identifiers

zbMath Open cooley.oliverMaRDI QIDQ322302

List of research outcomes





PublicationDate of PublicationType
Partitioning problems via random processes2025-01-08Paper
Cohomology groups of non-uniform random simplicial complexes2024-10-18Paper
The sparse parity matrix2024-07-19Paper
Partitioning problems via random processes2023-07-12Paper
On a question of Vera T. Sós about size forcing of graphons2023-01-23Paper
Loose cores and cycles in random hypergraphs2022-11-08Paper
The emergence of a giant rainbow component2022-10-21Paper
Phase transition in cohomology groups of non-uniform random simplicial complexes2022-08-04Paper
High-order bootstrap percolation in hypergraphs2022-01-24Paper
Warning Propagation: stability and subcriticality2021-11-30Paper
Longest Paths in Random Hypergraphs2021-11-04Paper
The sparse parity matrix2021-07-13Paper
Vanishing of cohomology groups of random simplicial complexes2021-06-15Paper
Paths, cycles and sprinkling in random hypergraphs2021-03-30Paper
Large Induced Matchings in Random Graphs2021-03-17Paper
On a question of Vera T. S\'os about size forcing of graphons2021-03-16Paper
Warning Propagation on random graphs2021-02-01Paper
Multi-coloured jigsaw percolation on random graphs2021-01-29Paper
Subcritical Random Hypergraphs, High-Order Components, and Hypertrees2020-10-27Paper
Vanishing of cohomology groups of random simplicial complexes2020-06-19Paper
The sharp threshold for jigsaw percolation in random graphs2019-12-09Paper
Subcritical random hypergraphs, high-order components, and hypertrees2019-09-18Paper
Core forging and local limit theorems for the \(k\)-core of random graphs2019-07-17Paper
The size of the giant component in random hypergraphs: a short proof2019-07-11Paper
Largest Components in Random Hypergraphs2018-11-05Paper
Jigsaw percolation on random hypergraphs2018-09-26Paper
The size of the giant high‐order component in random hypergraphs2018-09-25Paper
Homological connectedness of random hypergraphs2018-01-18Paper
How does the core sit inside the mantle?2017-10-24Paper
https://portal.mardi4nfdi.de/entity/Q53688992017-10-11Paper
The minimum bisection in the planted bisection model2017-08-31Paper
The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph2017-08-29Paper
How does the core sit inside the mantle?2016-10-14Paper
Evolution of high-order connected components in random hypergraphs2016-10-14Paper
Tight cycles in hypergraphs2016-10-14Paper
Regular slices for hypergraphs2016-10-14Paper
Threshold and hitting time for high-order connectedness in random hypergraphs2016-07-06Paper
The size of the giant component in random hypergraphs2015-01-30Paper
Loebl-Komlós-Sós conjecture: dense case2013-10-10Paper
Minimum degree conditions for large subgraphs2013-10-10Paper
Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs2010-08-13Paper
Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs2009-12-15Paper
Ramsey numbers of sparse hypergraphs2008-06-05Paper
3-uniform hypergraphs of bounded degree have linear Ramsey numbers2008-04-28Paper
Perfect packings with complete graphs minus an edge2007-11-21Paper

Research outcomes over time

This page was built for person: Oliver Cooley