ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C3C_3 be the triangle and let PnP_n be the path on nn vertices. Write r~(C3,Pn)\tilde{r}(C_3,P_n) for the minimum number of rounds in the online size Ramsey game in which Builder forces either a red copy of C3C_3 or a blue copy of PnP_n.

Conjecture on the triangle–path online size Ramsey number.

r~(C3,Pn)=3n−4 for every n≥3.\tilde{r}(C_3,P_n)=3n-4\text{ for every } n\ge 3.

The paper proves the upper bound r~(C3,Pn)≤3n−4\tilde{r}(C_3,P_n)\le 3n-4 and gives a lower bound with asymptotic coefficient φ+1\varphi+1, where φ\varphi is the golden ratio. The authors state that they believe the upper bound is sharp for every n≥3n\ge3, so the equality remains open.

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.