The Ramsey numbers of large cycles versus wheels (Q856890)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Ramsey numbers of large cycles versus wheels |
scientific article; zbMATH DE number 5080078
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Ramsey numbers of large cycles versus wheels |
scientific article; zbMATH DE number 5080078 |
Statements
The Ramsey numbers of large cycles versus wheels (English)
0 references
14 December 2006
0 references
A cycle \(C_n\) of length \(n\geq 3\) is a connected graph on \(n\) vertices in which every vertex has degree two. A wheel \(W_n\) is a graph on \(n+1\) vertices obtained from a cycle \(C_n\) by adding one vertex which is adjacent to all vertices of \(C_n\). The authors show that \(R(C_n,W_m)=2n-1\) whenever \(m\) is even and \(n+1\geq 5m/2\).
0 references
Ramsey numbers
0 references
cycle
0 references
wheel
0 references
