27 citations · 137 across the 40 of their papers we have counts for
5 papers · 1 filter
On the query complexity of estimating the distance to hereditary graph properties
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang +2
Given a family of graphs , we prove that the normalized edit distance of any given graph to being induced -free is estimable with a query complexity t…
The size-Ramsey number of powers of bounded degree trees
Sören Berger, Yoshiharu Kohayakawa, Giulia Satiko Maesaka +4
Given a positive integer , the -colour size-Ramsey number of a graph is the smallest integer such that there exists a graph with edges with the property that,…
The size-Ramsey number of 3-uniform tight paths
Jie Han, Yoshiharu Kohayakawa, Shoham Letzter +2
Given a hypergraph , the size-Ramsey number is the smallest integer such that there exists a graph with edges with the property that in any colouring…
Finding any given 2-factor in sparse pseudorandom graphs efficiently
Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1
Given an -vertex pseudorandom graph and an -vertex graph with maximum degree at most two, we wish to find a copy of in , i.e.\ an embedding $φ\colon V(H)\to V(…
The anti-Ramsey threshold of complete graphs
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Olaf Parczyk +1
For graphs and , let $G {\displaystyle\smash{\begin{subarray}{c} \hbox{$\tiny\rm rb$} \\ \longrightarrow \\ \hbox{$\tiny\rm p$} \end{subarray}}}H$ denote the property that f…