On the Ramsey Number r(F, Km) Where F is a Forest

DOI10.4153/CJM-1975-069-0zbMath0284.05108MaRDI QIDQ4770412

Saul Stahl

Publication date: 1975

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

A note on the Ramsey number for cycle with respect to multiple copies of wheels ⋮ The Ramsey number for a forest versus disjoint union of complete graphs ⋮ The graph Ramsey number \(R(F_\ell, K_6)\) ⋮ The ramsey numbers for stripes and one complete graph ⋮ Ramsey numbers for a disjoint union of good graphs ⋮ Ramsey numbers for a disjoint union of some graphs ⋮ Mixed ramsey numbers: Chromatic numbers versus graphs ⋮ Generalizations of a Ramsey-theoretic result of chvátal ⋮ Bounds for the ramsey number of a disconnected graph versus any graph ⋮ On ramsey numbers of forests versus nearly complete graphs ⋮ On ramsey numbers of forests versus nearly complete graphs

This page was built for publication: On the Ramsey Number r(F, K_m) Where F is a Forest