2 citations · 5 across the 6 of their papers we have counts for
5 papers · 2 filters
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…
More non-bipartite forcing pairs
Tamas Hubai, Dan Kral, Olaf Parczyk +1
We study pairs of graphs (H_1,H_2) such that every graph with the densities of H_1 and H_2 close to the densities of H_1 and H_2 in a random graph is quasirandom; such pairs (H_1,H…
2-universality in randomly perturbed graphs
Olaf Parczyk
A graph is called universal for a family of graphs if it contains every element as a subgraph. Let be the family of all gra…
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…