Covering 3-coloured random graphs with monochromatic trees

MaRDI QIDQ6621232FDOQ6621232

G. O. Mota, Walner Mendonça, Bjarne Schülke, Yoshiharu Kohayakawa

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Vertex coverings by monochromatic cycles and trees
• Vertex covers by monochromatic pieces -- a survey of results and problems
• Ryser's conjecture for tripartite 3-graphs
• Monochromatic trees in random graphs
• Partitioning random graphs into monochromatic components

This page was built for publication: Covering 3-coloured random graphs with monochromatic trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621232)