3 papers
math.CO2021
Tiling edge-coloured graphs with few monochromatic bounded-degree graphs
Jan Corsten, Walner Mendonça
We prove that for all integers , there is a constant such that the following is true for every sequence of graphs w…
math.CO2020
Covering -edge-coloured random graphs with monochromatic trees
Yoshiharu Kohayakawa, Walner Mendonça, Guilherme Oliveira Mota +1
We investigate the problem of determining how many monochromatic trees are necessary to cover the vertices of an edge-coloured random graph. More precisely, we show that for $p\gg…
math.CO2019
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,…