ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, let R3(G)=R(G,G,G)R_3(G)=R(G,G,G) denote its three-color diagonal Ramsey number, and let PnP_n be the path on nn vertices. Faudree–Schelp conjecture.

R3(Pn)=2n−2+(n mod 2)R_3(P_n)=2n-2+(n\bmod 2)

holds for all n≥1n\geq 1. This conjecture extends the theorem known for all sufficiently large nn and agrees with every value established in the paper; the cases R3(P8)R_3(P_8) and R3(P9)R_3(P_9) are subsequently determined there.

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.