Patrick Morris

collaborators

3 papers

math.CO2020

Factors in randomly perturbed hypergraphs

Yulin Chang, Jie Han, Yoshiharu Kohayakawa +2

We determine, up to a multiplicative constant, the optimal number of random edges that need to be added to a $k$ -graph $H$ with minimum vertex degree $Ω (n^{k - 1})$ to ensure an $F$ -…

math.CO2020

Ryser's Conjecture for $t$ -intersecting hypergraphs

Anurag Bishnoi, Shagnik Das, Patrick Morris +1

A well-known conjecture, often attributed to Ryser, states that the cover number of an $r$ -partite $r$ -uniform hypergraph is at most $r - 1$ times larger than its matching number.…

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…

Factors in randomly perturbed hypergraphs

Ryser's Conjecture for t-intersecting hypergraphs

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

Ryser's Conjecture for $t$ -intersecting hypergraphs