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

Publications

Papers submitted for publication

Journal Articles

Publications in peer-reviewed conference proceedings

  • The sparse parity matrix (with Amin Coja-Oghlan, Mihyun Kang, Joon Lee, Jean Bernoulli Ravelomanana), in Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
  • On a question of Vera T. Sós about size forcing of graphons (extended abstract) (with Mihyun Kang, Oleg Pikhurko), In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), CRM Research Perspectives, Springer.
  • Loose Cores and Cycles in Random Hypergraphs (extended abstract) (with Mihyun Kang, Julian Zalla), In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), CRM Research Perspectives, Springer.
  • 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.
  • Minimum degree conditions for large subgraphs (with Peter Allen, Julia Böttcher, Jan Hladký), Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), Electronic Notes in Discrete Mathematics 34, 74-79.
  • 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 15th August 2022