Y. Person

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

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

collaborators

3 papers

math.CO2026★ 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…

math.CO2026

Clique-factors in sparse pseudorandom graphs

Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1

We prove that for any $t \geq 3$ there exist constants $c > 0$ and $n_{0}$ such that any $d$ -regular $n$ -vertex graph $G$ with $t ∣ n \geq n_{0}$ and second largest eigenvalue in absolute…

math.CO2025

Blow-up lemmas for sparse graphs

Peter Allen, Julia BÃ¶ttcher, Hiep HÃ n +2

The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. Thi…