Patrick Morris

activity

20152023

most citedFinding any given 2-factor in sparse pseudorandom graphs efficiently

4 citations · 6 across the 9 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

Vertex Ramsey properties of randomly perturbed graphs

Shagnik Das, Patrick Morris, Andrew Treglown

Given graphs $F, H$ and $G$ , we say that $G$ is $(F, H)_{v}$ -Ramsey if every red/blue vertex colouring of $G$ containsa red copy of $F$ or a blue copy of $H$ . Results of Łuczak, Rucińs…

math.CO2019

Tilings in randomly perturbed graphs: bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu

Jie Han, Patrick Morris, Andrew Treglown

A perfect $K_{r}$ -tiling in a graph $G$ is a collection of vertex-disjoint copies of $K_{r}$ that together cover all the vertices in $G$ . In this paper we consider perfect $K_{r}$ -tiling…

math.CO2019★ 4 cited

Finding any given 2-factor in sparse pseudorandom graphs efficiently

Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1

Given an $n$ -vertex pseudorandom graph $G$ and an $n$ -vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$ , i.e.\ an embedding $φ\colon V(H)\to V(…