Monochromatic tree covers and Ramsey numbers for set-coloured graphs

DOI10.1016/J.DISC.2017.08.038zbMath1372.05136arXiv1510.05190OpenAlexW2384272649MaRDI QIDQ2411628

Maya Jakobine Stein, Sebastián Bustamante

Publication date: 24 October 2017

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

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

zbMATH Keywords

bounds for monochromatic tree covers

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (4)

Generalizations and strengthenings of Ryser's conjecture ⋮ On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs ⋮ Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited ⋮ Ryser's conjecture for \(t\)-intersecting hypergraphs

Cites Work

• Unnamed Item
• Vertex covers by monochromatic pieces -- a survey of results and problems
• Set-coloring of edges and multigraph Ramsey numbers
• Set colorings of graphs
• Partitioning by monochromatic trees
• Vertex coverings by monochromatic cycles and trees
• A generalization of Ramsey theory for graphs
• Set colourings of graphs
• Weakened Ramsey numbers
• Coloring vertices and edges of a graph by nonempty subsets of a set
• A Ramsey‐type problem and the Turán numbers*
• Partitioning complete multipartite graphs by monochromatic trees
• Partition relations for cardinal numbers

This page was built for publication: Monochromatic tree covers and Ramsey numbers for set-coloured graphs