ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CnC_n be the cycle on nn vertices and let Wm:=Cm∗K1W_m:=C_m\ast K_1 be the wheel on m+1m+1 vertices. For integers n<mn<m, with nn odd and mm even, the Ramsey number r(Cn,Wm)r(C_n,W_m) is the least integer NN such that every red-blue coloring of the edges of KNK_N contains either a red copy of CnC_n or a blue copy of WmW_m.

Zhang et al.'s conjecture. For integers n<mn<m, with nn odd and mm even,

r(Cn,Wm)=2m+1.r(C_n,W_m)=2m+1.

The conjecture concerns the remaining case of asymmetric Ramsey numbers for cycles and wheels identified in the paper: odd nn and even mm with n<m<3(n−1)/2n<m<3(n-1)/2.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.