The Ramsey numbers of paths versus wheels: a complete solution

From MaRDI portal




Abstract: Let G1 and G2 be two given graphs. The Ramsey number R(G1,G2) is the least integer r such that for every graph G on r vertices, either G contains a G1 or overlineG contains a G2. We denote by Pn the path on n vertices and Wm the wheel on m+1 vertices. Chen et al. and Zhang determined the values of R(Pn,Wm) when mleqn+1 and when n+2leqmleq2n, respectively. In this paper we determine all the values of R(Pn,Wm) for the left case mgeq2n+1. Together with Chen et al's and Zhang's results, we give a complete solution to the problem of determining the Ramsey numbers of paths versus wheels.









This page was built for publication: The Ramsey numbers of paths versus wheels: a complete solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490252)