Monochromatic trees in random graphs

DOI10.1016/j.endm.2017.07.033zbMath1379.05025arXiv1611.10299OpenAlexW2964254121WikidataQ101496530 ScholiaQ101496530MaRDI QIDQ1690004

Mathias Schacht, Guilherme Oliveira Mota, Yoshiharu Kohayakawa

Publication date: 18 January 2018

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.10299

zbMATH Keywords

random graphsRamsey theory

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (8)

Generalizations and strengthenings of Ryser's conjecture ⋮ Vertex covering with monochromatic pieces of few colours ⋮ Covering random graphs with monochromatic trees ⋮ Ramsey goodness of trees in random graphs ⋮ Monochromatic trees in random graphs ⋮ Partitioning random graphs into monochromatic components ⋮ Monochromatic cycle partitions in random graphs ⋮ Covering 3-Edge-Colored Random Graphs with Monochromatic Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning random graphs into monochromatic components
• Monochromatic trees in random graphs
• Graph Theory
• Sharp thresholds of graph properties, and the $k$-sat problem

This page was built for publication: Monochromatic trees in random graphs