Covering 3-Edge-Colored Random Graphs with Monochromatic Trees

DOI10.1137/20M137464XzbMath1468.05228arXiv2006.14469MaRDI QIDQ4997138

Walner Mendonça, Bjarne Schülke, Yoshiharu Kohayakawa, Guilherme Oliveira Mota

Publication date: 28 June 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random graphsgraph partitioningmonochromatic trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Covering random graphs with monochromatic trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Ryser's conjecture
• Partitioning random graphs into monochromatic components
• Ryser's conjecture for tripartite 3-graphs
• Partitioning by monochromatic trees
• Vertex coverings by monochromatic cycles and trees
• Monochromatic trees in random graphs
• Monochromatic cycle covers in random graphs

This page was built for publication: Covering 3-Edge-Colored Random Graphs with Monochromatic Trees