Y. Kohayakawa

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

10 papers

math.CO2026

A canonical Ramsey theorem for even cycles in random graphs

JosÃ© D. Alvarado, Y. Kohayakawa, Patrick Morris +1

The celebrated canonical Ramsey theorem of ErdÅs and Rado implies that for $2 \leq k \in N$ , any colouring of the edges of $K_{n}$ with $n$ sufficiently large gives a copy of…

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

A sparse canonical van der Waerden theorem

JosÃ© D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris +2

The canonical van der Waerden theorem asserts that, for sufficiently large $n$ , every colouring of $[n]$ contains either a monochromatic or a rainbow arithmetic progression of leng…

math.CO2026

The multicolor induced size-Ramsey number of long subdivisions

Ramin Javadi, Yoshiharu Kohayakawa, Meysam Miralaei

For a positive integer $k$ and a graph $H$ , the $k$ -color induced size-Ramsey number $R^_{ind} (H, k)$ is the minimum integer $m$ for which there exists a graph $G$ wi…

math.CO2026

The Multicolor Size-Ramsey Number of Bipartite Long Subdivisions

Ramin Javadi, Yoshiharu Kohayakawa, Meysam Miralaei

For a positive integer $r$ , the $r$ -color size-Ramsey number~ $R_{r} (H)$ of a graph $H$ is the minimum number of edges in a graph $G$ such that every $r$ -edge coloring of $G…