15 citations · 83 across the 30 of their papers we have counts for
4 papers · 1 filter
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…
Decomposing split graphs into locally irregular graphs
Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli
A graph is locally irregular if any pair of adjacent vertices have distinct degrees. A locally irregular decomposition of a graph is a decomposition of such t…
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…