The Ramsey numbers of paths versus wheels: a complete solution
From MaRDI portal
Publication:490252
zbMATH Open1305.05140arXiv1312.2081MaRDI QIDQ490252FDOQ490252
Publication date: 22 January 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: Let and be two given graphs. The Ramsey number is the least integer such that for every graph on vertices, either contains a or contains a . We denote by the path on vertices and the wheel on vertices. Chen et al. and Zhang determined the values of when and when , respectively. In this paper we determine all the values of for the left case . 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.
Full work available at URL: https://arxiv.org/abs/1312.2081
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cites Work
- On maximal paths and circuits of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some remarks on the theory of graphs
- Some Theorems on Abstract Graphs
- New sufficient conditions for cycles in graphs
- Path-cycle Ramsey numbers
- The Ramsey numbers of paths versus wheels
- The Ramsey number of paths with respect to wheels
- Path-star Ramsey numbers
- Title not available (Why is that?)
- On Ramsey numbers for paths versus wheels
Cited In (7)
- The Ramsey numbers of paths versus wheels
- The Ramsey number of paths with respect to wheels
- The Ramsey numbers for trees of large maximum degree versus the wheel graph \(W_8\)
- On path-quasar Ramsey numbers
- The Ramsey numbers of trees versus generalized 6-wheels or generalized 7-wheels
- Closing the gap on path-kipas Ramsey numbers
- On Ramsey numbers for 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)