Patrick Morris
About me
I am currently a postdoctoral researcher in the GAPCOMB group at Universitat Politècnica de Catalunya (UPC) in Barcelona, hosted by Prof. Guillem Perarnau and funded by a Marie Curie fellowship from the European Union under the Horizon scheme.
I completed my PhD in 2021 in the Combinatorics and Graph Theory group of the Mathematics department at the Freie Universität Berlin, under the supervision of Prof. Tibor Szabó. I also did a Master's in the same group and before that a 4 year Msci at the University of Bristol. Here is my (perhaps outdated) CV.
Contact
pmorrismaths -at- gmail.com
Edifici Omega, Carrer de Jordi Girona, 29, 08034 Barcelona, Room 433
Research
I am primarily interested in Extremal and Probabilistic Combinatorics but also like interactions with other areas such as Discrete Probability, Number Theory, Algebra, Group Theory, Design Theory, Finite Geometry and Topology.
Papers
A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs
(with Amarja Kathapurkar and Guillem Perarnau)
submitted
An extended abstract appeared in the conference proceedings of DMD 2024, pp. 30-35A note on finding large transversals efficiently
(with Michael Anastos),
submittedA canonical Ramsey theorem for even cycles in random graphs
(with José D. Alvarado, Yoshiharu Kohayakawa and Guilherme O. Mota),
submittedSlow graph bootstrap percolation II: Accelerating properties
(with David Fabian and Tibor Szabó),
Journal of Combintarial Theory, Series B, to appear
An extended abstract appeared in the conference proceedings of DMD 2022, pp. 134-140Universality for transversal Hamilton cycles
(with Candida Bowtell, Yanitsa Pehova and Katherine Staden)
Bulletin of the London Mathematical Society, to appearSlow graph bootstrap percolation I: Cycles
(with David Fabian and Tibor Szabó),
submittedTwo-round Ramsey games on random graphs
(with Yahav Alon and Wojciech Samotij),
submittedA canonical Ramsey theorem with list constraints in random graphs
(with José D. Alvarado, Yoshiharu Kohayakawa and Guilherme O. Mota),
submitted
An extended abstract appeared in the conference proceedings of LAGOS 2023, pp. 13-19 and won the Best Paper AwardA robust Corrádi-Hajnal Theorem
(with Peter Allen, Julia Böttcher, Jan Corsten, Ewan Davies, Matthew Jenssen, Barnaby Roberts and Jozef Skokan),
Random Structures & Algorithms, 65 (1), 61-130, 2024Speeding up random walk mixing by starting from a uniform vertex
(with Alberto Espuny Díaz, Guillem Perarnau and Oriol Serra)
Electronic Journal of Probability, 29, 1-25, 2024Schur properties of randomly perturbed sets
(with Shagnik Das and Charlotte Knierim),
European Journal of Combinatorics (special issue devoted to selected papers from EuroComb21), 121, 103843, 2024
An extended abstract appeared in the conference proceedings of Eurocomb 2021, pp. 384-389A Ramsey–Turán theory for tilings in graphs
(with Jie Han, Guanghui Wang and Donglei Yang)
Random Structures & Algorithms, 64 (1), 94-124, 2023Clique factors in pseudorandom graphs,
Journal of the European Mathematical Society, to appear
An extended abstract appeared in the conference proceedings of SODA 2021, pp. 899-918Factors in randomly perturbed hypergraphs
(with Yulin Chang, Jie Han, Yoshiharu Kohayakawa and Guilherme Oliveira Mota)
Random Structures & Algorithms, 60 (2), 153-165, 2022Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
(with Hiệp Hàn and Jie Han)
Random Structures & Algorithms, 61 (1), 101-125, 2022.
An extended abstract appeared in the conference proceedings of SODA 2020, pp. 702-717
Ryser's Conjecture for t-intersecting hypergraphs
(with Anurag Bishnoi, Shagnik Das and Tibor Szabó)
Journal of Combinatorial Theory, Series A, 179, 105366, 2021.
See also the blogpost of Anurag Bishnoi about this project
Vertex Ramsey properties of randomly perturbed graphs
(with Shagnik Das and Andrew Treglown)
Random Structures & Algorithms, 57 (4), 983-1006, 2020
Tilings in randomly perturbed graphs: bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu
(with Jie Han and Andrew Treglown)
Random Structures & Algorithms, 58 (3), 480-516, 2021
Finding any given 2-factor in sparse pseudorandom graphs efficiently
(with Jie Han, Yoshiharu Kohayakawa and Yury Person)
Journal of Graph Theory, 96 (1), 87-108, 2021
Clique factors in sparse pseudorandom graphs
(with Jie Han, Yoshiharu Kohayakawa and Yury Person)
European Journal of Combinatorics, 82, 102999, 2019
Beyond the excised ensemble: modelling elliptic curve L-functions with random matrices
(with Ian Cooper and Nina Snaith)
Journal of Physics A: Mathematical and Theoretical, 49 (7), 075202, 2016
Co-authors
Peter Allen, Yahav Alon, José D. Alvarado (2), Michael Anastos, Anurag Bishnoi, Julia Böttcher, Candida Bowtell, Yulin Chang, Ian Cooper, Jan Corsten, Shagnik Das (3), Ewan Davies, Alberto Espuny Díaz, David Fabian (2), Hiệp Hàn, Jie Han (6), Matthew Jenssen, Amarja Kathapurkar, Charlotte Knierim, Yoshiharu Kohayakawa (5), Guilherme Oliveira Mota (3), Miquel Ortega, Yanitsa Pehova, Guillem Perarnau (2), Yury Person (2), Barnaby Roberts, Wojciech Samotij, Oriol Serra, Jozef Skokan, Nina Snaith, Katherine Staden, Tibor Szabó (3), Andrew Treglown (2), Guanghui Wang, Donglei Yang
Theses
Clique Factors: Extremal and Probabilistic Perspectives, Doctoral thesis supervised by Prof. Tibor Szabó, FU Berlin, 2021
Random Steiner triple systems, Master's thesis supervised by Prof. Tibor Szabó, FU Berlin, 2017 (Based primarily on the work of Matthew Kwan)
Permutation Groups, Bases and Probabilistic Methods, Master's thesis supervised by Dr Tim Burness, University of Bristol, 2015 (Based primarily on the work of Liebeck and Shalev)