Corrigendum to: ``The Ramsey numbers for stripes and complete graphs 1'', Discrete Mathematics 104 (1992) 91--97 (Q1331988): Difference between revisions

Ian Hawthorn has pointed out an error in the proof of the Theorem of this paper (Zbl 0760.05067). While the error does not invalidate the result in the Theorem, further investigation suggests that the proof will need more detailed considerations than appeared necessary at first. Until that is done, it seems best to replace the Theorem by a weaker one which can be proved without difficulty. Theorem. If \(p> 2\), \(d<p\) and \(n_ j\geq m\) for \(j= 1,\dots,d\) then \[ mp+ \sum^ d_{j=1} (2n_ j- 1- m)\leq r(mK_ p,n_ 1 P_ 2,\dots, n_ d P_ 2)\leq mp+ \sum^ d_{j=1} (2n_ j- 2). \] The incorrectly proved result in the paper is that the Ramsey number is actually equal to the lower bound in this theorem.