Covering $3$-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…