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 2021Show all

2 papers · 1 filter

math.CO2021

A Ramsey-Turán theory for tilings in graphs

Jie Han, Patrick Morris, Guanghui Wang +1

For a $k$ -vertex graph $F$ and an $n$ -vertex graph $G$ , an $F$ -tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ . For $r \in N$ , the $r$ -independence nu…

math.CO2021

Clique factors in pseudorandom graphs

Patrick Morris

An $n$ -vertex graph is said to to be $(p, β)$ -bijumbled if for any vertex sets $A, B \subseteq V (G)$ , we have \[e(A,B)=p|A||B|\pm β\sqrt{|A||B|}.\] We prove that for any $3\leq r\in \…