No label defined (Q4087229)

[For the entire collection see Zbl 0293.00009.] For a finite graph \(G\) and positive integer \(k\), let \(r(G;k)\) denote the least integer \(r\) such that if the edges of \(K_r\), the complete graph on \(r\) vertices are arbitrarily partitioned into \(k\) classes then some class contains a subgraph isomorphic to \(G\). The existence of \(r(G;k)\) follows from the well known theorem of Ramsey. In this paper, the authors have investigated the behavior of \(r(G;k)\) for various classes of graphs including trees, forests and cycles \(C_n\), where \(n\) is odd or even. A typical result is given by \(2^kn<r(C_{2n+1};k)<2(k+2)!n\).