On the Ramsey numbers of wheels, cycles, and stars
Abstract
The wheel Wk is the graph on k+1 vertices consisting of a vertex joined to a cycle of length k, and we say that Wk is an even wheel if k is even. Mao, Wang, Magnant, Schiermeyer proved that the Ramsey number of W2n is between 4n+1 and 12n-2. We improve both of these bounds, showing that 5n-1+(-1)n2≤ R(W2n)≤ 8n+664 for all integers n≥ 2. The main focus of the paper concerns two general results on the Ramsey numbers of stars versus even wheels and even cycles versus even wheels, from which the above bounds are obtained as a corollary. That is, we asymptotically determine R(K1,m, W2n) and R(C2m, W2n) for all sufficiently large m and n, both of which were open problems for most regimes. As for odd wheels, we note that the analogous values for stars versus odd wheels and odd cycles versus odd wheels were already known exactly, from which it follows that 6n+4=R(K1,2n+1, W2n+1)≤ R(W2n+1)≤ 2· R(C2n+1, W2n+1)=12n+2. Very recently, Zhang and Chen improved the upper bound to R(W2n+1)≤ 32n3+O(1). We are able to refine their proof, further improving the upper bound to R(W2n+1)≤ 10n+O(1).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.