Conjecture on Gallai–Ramsey numbers of even wheels

Let W2nW_{2n} denote the wheel graph with an even cycle of length 2n2n, let GRk(H)GR_k(H) denote the kk-color Gallai–Ramsey number of a graph HH, and let R2(W2n)R_2(W_{2n}) denote the two-color Ramsey number of W2nW_{2n}. Even-wheel Gallai–Ramsey conjecture. For all k2k\ge2 and n2n\ge2,

GRk(W2n)={(R2(W2n)1)5k22+1,if k is even,2(R2(W2n)1)5k32+1,if k is odd.GR_k(W_{2n})=\begin{cases}(R_2(W_{2n})-1)\cdot5^{\frac{k-2}{2}}+1,&\text{if }k\text{ is even},\\2(R_2(W_{2n})-1)\cdot5^{\frac{k-3}{2}}+1,&\text{if }k\text{ is odd}. \end{cases}

The formula is motivated by the exact computation of GRk(W4)GR_k(W_4) for all k2k\ge2, together with a lower bound for general even wheels. Its validity for all even wheels and all k2k\ge2 remains open.

Sources & referencesView supporting material

Primary source

Zi-Xia Song, Bing Wei, Fangfang Zhang and Qinghong Zhao, “A note on Gallai-Ramsey number of even wheels”, arXiv:1905.13564 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.