Improved bounds show the Ramsey number for even wheels lies between roughly 5n and 8n plus a constant, while related mixed Ramsey numbers with stars and even cycles are asymptotically determined for large graphs.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
A polynomial-time algorithm constructs a properly colored spanning tree of order at least min(n, 2δ^c(G) + 1) in any connected edge-colored graph G whenever such a tree exists.
Improved bounds: 3n-2 ≤ R(W_n,W_n) ≤ 6n-6 for even n≥8; 2n ≤ R(W_n,W_n) ≤ (9n-7)/2 for odd n≥7, with recursive k-color extensions.
citing papers explorer
-
On the Ramsey numbers of wheels, cycles, and stars
Improved bounds show the Ramsey number for even wheels lies between roughly 5n and 8n plus a constant, while related mixed Ramsey numbers with stars and even cycles are asymptotically determined for large graphs.
-
Above-Guarantee Algorithm for Properly Colored Spanning Trees
A polynomial-time algorithm constructs a properly colored spanning tree of order at least min(n, 2δ^c(G) + 1) in any connected edge-colored graph G whenever such a tree exists.
-
Diagonal Ramsey numbers for wheels
Improved bounds: 3n-2 ≤ R(W_n,W_n) ≤ 6n-6 for even n≥8; 2n ≤ R(W_n,W_n) ≤ (9n-7)/2 for odd n≥7, with recursive k-color extensions.