Monochromatic trees in random graphs

Bal and DeBiasio [Partitioning random graphs into monochromatic components, Electron. J. Combin. 24 (2017), Paper 1.18] put forward a conjecture concerning the threshold for the following Ramsey-type property for graphs $G$: every $k$-colouring of the edge set of $G$ yields $k$ pairwise vertex disjoint monochromatic trees that partition the whole vertex set of $G$. We determine the threshold for this property for two colours.

[1]  W. Marsden.  I and J , 2012 .

[2]  Robin Wilson,et al.  Modern Graph Theory , 2013 .

[3]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[4]  E. Friedgut,et al.  Sharp thresholds of graph properties, and the -sat problem , 1999 .

[5]  Frank Harary,et al.  Graph Theory , 2016 .

[6]  Louis DeBiasio,et al.  Partitioning Random Graphs into Monochromatic Components , 2017, Electron. J. Comb..

[7]  YOSHIHARU KOHAYAKAWA,et al.  Monochromatic trees in random graphs , 2018, Mathematical Proceedings of the Cambridge Philosophical Society.