# Oliver Cooley

According to our database

Collaborative distances:

^{1}, Oliver Cooley authored at least 22 papers between 2007 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Subcritical random hypergraphs, high-order components, and hypertrees.

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018

The size of the giant high-order component in random hypergraphs.

Random Struct. Algorithms, 2018

Largest Components in Random Hypergraphs.

Combinatorics, Probability & Computing, 2018

Vanishing of Cohomology Groups of Random Simplicial Complexes (Keynote Speakers).

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

How does the core sit inside the mantle?

Random Struct. Algorithms, 2017

Tight cycles and regular slices in dense hypergraphs.

J. Comb. Theory, Ser. A, 2017

Jigsaw percolation on random hypergraphs.

J. Applied Probability, 2017

Homological connectedness of random hypergraphs.

Electronic Notes in Discrete Mathematics, 2017

The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph.

Discrete Mathematics, 2017

2016

Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs.

Electr. J. Comb., 2016

2015

Evolution of high-order connected components in random hypergraphs.

Electronic Notes in Discrete Mathematics, 2015

How does the core sit inside the mantle?

Electronic Notes in Discrete Mathematics, 2015

Regular slices for hypergraphs.

Electronic Notes in Discrete Mathematics, 2015

Tight Cycles in Hypergraphs.

Electronic Notes in Discrete Mathematics, 2015

The Minimum Bisection in the Planted Bisection Model.

Proceedings of the Approximation, 2015

2009

Loebl-Komlós-Sós Conjecture: dense case.

Electronic Notes in Discrete Mathematics, 2009

Minimum degree conditions for large subgraphs.

Electronic Notes in Discrete Mathematics, 2009

Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs.

Discrete Mathematics, 2009

Embeddings and Ramsey numbers of sparse

*kappa*-uniform hypergraphs.
Combinatorica, 2009

2008

3-Uniform hypergraphs of bounded degree have linear Ramsey numbers.

J. Comb. Theory, Ser. B, 2008

2007

Ramsey numbers of sparse hypergraphs.

Electronic Notes in Discrete Mathematics, 2007

Perfect packings with complete graphs minus an edge.

Eur. J. Comb., 2007