The Ramsey numbers for stripes and complete graphs 1 (Q1197007)

This paper continues the programme of calculating the Ramsey numbers \(r(m_ 1K_{p_ 1},\dots,m_ cK_{p_ c})\) outlined at the end of the first author's paper [J. Graph Theory 8, 177-184 (1984; Zbl 0539.05046)] by proving the following theorem: If \(p>2\), \(d<p\) and \(n_ j\geq m\) for \(j=1,\dots,d\) then \(r(mK_ p,n_ 1P_ 2,\dots,n_ dP_ 2)=mp+\sum^ d_{j=1}(2n_ j-1-m)\). Here, if \(G_ 1,\dots,G_ c\) are graphs without loops or multiple edges, the Ramsey number \(r(G_ 1,\dots,G_ c)\) is the smallest integer such that if the edges of a complete graph \(K_ n\), with \(n\geq r(G_ 1,\dots,G_ c)\), are painted arbitrarily with \(c\) colours the \(i\)th coloured subgraph contains \(G_ i\) as a subgraph for at least one \(i\). Also, \(mK_ p\) stands for \(m\) disjoint copies of the complete graph on \(p\) vertices and \(n_ jP_ 2\) stands for \(n_ j\) disjoint copies of the path (or complete graph) with two vertices.