Abstract
Bal and DeBiasio presented a conjecture with respect to a threshold for the following Ramsey-type property for graphs G: in every edge-colouring of G with r colours, there exist r disjoint monochromatic trees that partition the vertex-set of G. Recently it was proved that for 2 colours, the threshold for this property is given by ((\log n)/n)^{1/2}.In this project, we will study this resu…