Monochromatic trees in random graphs

@article{Kohayakawa2017MonochromaticTI,
  title={Monochromatic trees in random graphs},
  author={Yoshiharu Kohayakawa and Guilherme Oliveira Mota and Mathias Schacht},
  journal={Electronic Notes in Discrete Mathematics},
  year={2017},
  volume={61},
  pages={759-764}
}
Bal and DeBiasio [Partitioning random graphs into monochromatic components, Electron. J. Combin. 24 (2017), no. 1, Paper 1.18] put forward a conjecture concerning the threshold for the following Ramsey-type property for graphs G: every r-colouring of the edge set of G yields r pairwise vertex disjoint monochromatic trees that partition the whole vertex set of G. We determine the threshold for this property for two colours. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Monochromatic trees in random graphs, arXiv e-prints

  • Y. Kohayakawa, G. O. Mota, M. Schacht
  • Electronic Notes in Discrete Mathematics
  • 2017
1 Excerpt

Similar Papers

Loading similar papers…