27 citations · 137 across the 40 of their papers we have counts for
52 papers
Local Resilience for Containment of Bounded Degree Spanning Subgraphs
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1
We prove that for all and , there exists a constant such that for , asymptotically almost surely, every spanning subgraph …
The multicolor induced size-Ramsey number of long subdivisions
Ramin Javadi, Yoshiharu Kohayakawa, Meysam Miralaei
For a positive integer and a graph , the -color induced size-Ramsey number is the minimum integer for which there exists a graph wi…
The Multicolor Size-Ramsey Number of Bipartite Long Subdivisions
Ramin Javadi, Yoshiharu Kohayakawa, Meysam Miralaei
For a positive integer , the -color size-Ramsey number~ of a graph is the minimum number of edges in a graph such that every -edge coloring of $G…
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 , every colouring of contains either a monochromatic or a rainbow arithmetic progression of leng…
Robustness of the Sauer-Spencer Theorem
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1
We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define to be a random subgraph of obtained by retaining e…
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 , any colouring of the edges of with sufficiently large gives a copy of…