ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TnT_n be an arbitrary tree on nn vertices, let CmC_m be a cycle on mm vertices, and let R(Tn,Cm)R(T_n,C_m) denote the Ramsey number of TnT_n versus CmC_m. Define f(m)f(m) to be the least function such that R(Tn,Cm)=2n−1R(T_n,C_m)=2n-1 for every odd m≥3m\geq 3 whenever n≥f(m)n\geq f(m). Huang–Zhang–Chen conjecture. For every odd m≥5m\geq 5 and every n≥⌈(2m−1)/3⌉n\geq \lceil (2m-1)/3\rceil,

R(Tn,Cm)=2n−1.R(T_n,C_m)=2n-1.

The known bounds are ⌈(2m−1)/3⌉≤f(m)≤2m−4\lceil (2m-1)/3\rceil\leq f(m)\leq 2m-4; the conjecture asserts that the lower bound, obtained from the exact path–cycle Ramsey number, is sharp.

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.