The Ramsey numbers of paths versus wheels: a complete solution (Q490252): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 1312.2081 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Ramsey number of paths with respect to wheels / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Ramsey numbers of paths versus wheels / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Theorems on Abstract Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some remarks on the theory of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New sufficient conditions for cycles in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path-cycle Ramsey numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5548200 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path-star Ramsey numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Ramsey numbers for paths versus wheels / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3070339 / rank | |||
Normal rank |
Latest revision as of 13:51, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Ramsey numbers of paths versus wheels: a complete solution |
scientific article |
Statements
The Ramsey numbers of paths versus wheels: a complete solution (English)
0 references
22 January 2015
0 references
Summary: Let \(G_1\) and \(G_2\) be two given graphs. The Ramsey number \(R(G_1,G_2)\) is the least integer \(r\) such that for every graph \(G\) on \(r\) vertices, either \(G\) contains a \(G_1\) or \(\overline{G}\) contains a \(G_2\). We denote by \(P_n\) the path on \(n\) vertices and \(W_m\) the wheel on \(m+1\) vertices. \textit{Y. Chen} et al. [Discrete Math. 290, No. 1, 85--87 (2005; Zbl 1059.05074)] and \textit{Y. Zhang} [Ars Comb. 89, 11--20 (2008; Zbl 1224.05346)] determined the values of \(R(P_n,W_m)\) when \(m\leq n+1\) and when \(n+2\leq m\leq 2n\), respectively. In this paper we determine all the values of \(R(P_n,W_m)\) for the left case \(m\geq 2n+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.
0 references
Ramsey number
0 references
path
0 references
wheel
0 references