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 2020 · math.COShow all

3 papers · 2 filters

math.CO2020★ 1 cited

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

Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs

Hiep Hàn, Jie Han, Patrick Morris

We investigate the emergence of spanning structures in sparse pseudo-random $k$ -uniform hypergraphs, using the following comparatively weak notion of pseudo-randomness. A $k$ -unifo…

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.…

Factors in randomly perturbed hypergraphs

Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs

Ryser's Conjecture for t-intersecting hypergraphs

Ryser's Conjecture for $t$ -intersecting hypergraphs