10 citations · 10 across the 4 of their papers we have counts for
6 papers
A rainbow version of Lehel's conjecture
Pedro Araújo, Xiao-Chuan Liu, Taísa Martins +4
Lehel's conjecture states that every 2-edge-colouring of K_n admits a partition of its vertex set into two monochromatic cycles. It was proven for sufficiently large n by Łuczak, R…
Graphs with asymmetric Ramsey properties
Walner Mendonça, Meysam Miralaei, Guilherme O. Mota
Given positive integers and we write if every 2-colouring of the edges of yields a red copy of or a blue copy of and we d…
Degree conditions for Ramsey goodness of paths
Lucas Aragão, João Pedro Marciano, Walner Mendonça
A classical result of Chvátal implies that if , then any colouring of the edges of in red and blue contains either a monochromatic red or a monoch…
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…
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…
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,…