On the Ramsey Number r(F, Km) Where F is a Forest
Saul Stahl · Canadian Journal of Mathematics · 1975
The graphs considered here are finite and have no loops or multiple edges. In particular, Km denotes the complete graph on m vertices. For any graph G,V(G) and E(G) denote, respectively, the vertex and edge sets of G. A forest is a graph which has no cycles and a tree is a connected forest. The reader is referred to [1] or [4] for the meaning of terms not defined in this paper.