A generalization of Ramsey theory for linear forests

DOI10.1080/00207160.2012.685469zbMath1257.05095OpenAlexW2041592468MaRDI QIDQ4903490

No author found.

Publication date: 22 January 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.685469

zbMATH Keywords

edge colouring\(d\)-chromatic Ramsey numberweakened Ramsey numbers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (3)

On group choosability of total graphs ⋮ The (t−1) $(t-1)$‐chromatic Ramsey number for paths ⋮ Coverings by few monochromatic pieces: a transition between two Ramsey problems

Cites Work

• Generalized Ramsey numbers for paths in 2-chromatic graphs
• Ramsey numbers for all linear forests
• A generalization of Ramsey theory for graphs
• Weakened Ramsey numbers
• The Ramsey number for stripes

This page was built for publication: A generalization of Ramsey theory for linear forests