Oliver Cooley - Main  |  About me  |  Research  |  Publications  |  Teaching  |  Institute  |  Combinatorics Group

Publications

Papers submitted for publication

Journal Articles

  • Longest paths in random hypergraphs (with Frederik Garbe, Eng Keat Hng, Mihyun Kang, Nicolás Sanhueza-Matamala, Julian Zalla), accepted for publication in SIAM J. Discrete Math.
  • Large induced matchings in random graphs (with Nemanja Draganić, Mihyun Kang, Benny Sudakov), SIAM J. Discrete Math. 35 (2021), no. 1, 267--280.
  • Subcritical random hypergraphs, high-order components, and hypertrees (with Wenjie Fang, Nicola Del Giudice, Mihyun Kang), SIAM J. Discrete Math., 34 (2020), no. 4, 2033--2062.
  • Multi-coloured jigsaw percolation on random graphs (with Abraham Gutiérrez), Journal of Combinatorics, 11 (2020), no. 4, 603--624.
  • Vanishing of cohomology groups of random simplicial complexes (with Nicola del Giudice, Mihyun Kang, Philipp Sprüssel), Random Structures and Algorithms, 56 (2020), 461--500.
  • The sharp threshold for jigsaw percolation in random graphs (with Tobias Kapetanopoulos, Tamás Makai), Advances in Applied Probability, 51(2) (2019), 378-407. doi:10.1017/apr.2019.24.
  • The size of the giant component in random hypergraphs: a short proof (with Mihyun Kang, Christoph Koch), Electronic Journal of Combinatorics 26 (2019), no. 3, Paper 3.6, 17 pp.
  • Core forging and local limit theorems for the k-core of random graphs (with Amin Coja-Oghlan, Mihyun Kang, Kathrin Skubch), Journal of Combinatorial Theory, Series B 137 (2019), 178--231.
  • The size of the giant component in random hypergraphs (with Mihyun Kang, Christoph Koch), Random Structures and Algorithms 53 (2018), 238--288.
  • Largest components in random hypergraphs (with Mihyun Kang, Yury Person), Combinatorics, Probability and Computing 27 (2018), no. 5, 741--762.
  • Jigsaw percolation on random hypergraphs (with Béla Bollobás, Mihyun Kang, Christoph Koch), Journal of Applied Probability 54 (2017), 1261--1277.
  • The minimum bisection in the planted bisection model (with Amin Coja-Oghlan, Mihyun Kang, Kathrin Skubch), Theory of Computing, 13 (2017), 1--22.
  • How does the core sit inside the mantle? (with Amin Coja-Oghlan, Mihyun Kang, Kathrin Skubch), Random Structures and Algorithms, 51 (2017), 459--482.
  • The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph (with Richard Mycroft), Discrete Math. 340 (2017), no. 6, 1172--1179.
  • Tight cycles and regular slices in dense hypergraphs (with Peter Allen, Julia Böttcher, Richard Mycroft), Journal of Combinatorial Theory, Series A 149 (2017), 30--100.
  • Threshold and hitting time for high-order connectedness in random hypergraphs (with Mihyun Kang, Christoph Koch), Electron. J. Combin. 23 (2016), no. 2, Paper 2.48, 14 pp.
  • The Loebl-Komlós-Sós conjecture for large dense graphs, Discrete Math. 309 (2009), no. 21, 6190--6228.
  • Embeddings and Ramsey numbers of sparse k-uniform hypergraphs (with Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus), Combinatorica 29 (2009), 263-297.
  • 3-uniform hypergraphs of bounded degree have linear Ramsey numbers (with Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus), J. Combinatorial Theory Series B 98 (2008), 484-505.
  • Perfect packings with complete graphs minus an edge (with Daniela Kühn, Deryk Osthus), European J. Combinatorics 28 (2007), 2143-2155.

Publications in peer-reviewed conference proceedings

  • Cohomology groups of non-uniform random simplicial complexes (with Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel), Acta Math. Univ. Comenian. (N.S.) 88 (2019), no. 3, 553--560. (Eurocomb 2019).
  • Subcritical random hypergraphs, high-order components, and hypertrees (with Wenjie Fang, Nicola Del Giudice, Mihyun Kang), 2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 111--118, SIAM, Philadelphia, PA, 2019.
  • Vanishing of cohomology groups of random simplicial complexes (with Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel), Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), pp. 7:1-7:14.
  • Homological connectedness of random hypergraphs (with Penny Haxell, Mihyun Kang, Philipp Sprüssel), Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics 61 (2017), 279-285.
  • Regular slices for hypergraphs (with Peter Allen, Julia Böttcher, Richard Mycroft), Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2015), Electronic Notes in Discrete Mathematics 49, 691-698.
  • Tight Cycles in Hypergraphs (with Peter Allen, Julia Böttcher, Richard Mycroft), Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2015), Electronic Notes in Discrete Mathematics 49, 675-682.
  • Evolution of high-order connected components in random hypergraphs (with Mihyun Kang, Christoph Koch), Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), Electronic Notes in Discrete Mathematics (2015), 569-575.
  • How does the core sit inside the mantle? (with Amin Coja-Oghlan, Mihyun Kang, Kathrin Skubch), Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), Electronic Notes in Discrete Mathematics (2015), 489-496.
  • The minimum bisection in the planted bisection model (with Amin Coja-Oghlan, Mihyun Kang, Kathrin Skubch), Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM 2015), Leibniz International Proceedings in Informatics (LIPIcs), 710-725, 2015.
  • Loebl-Komlós-Sós conjecture: dense case (with Jan Hladký, Diana Piguet), Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), Electronic Notes in Discrete Mathematics 34, 609–613.


last modified 13th September 2021