Faudree–Schelp conjecture for three-color Ramsey numbers of paths
Statement
For a graph , let denote its three-color diagonal Ramsey number, and let be the path on vertices. Faudree–Schelp conjecture.
holds for all . This conjecture extends the theorem known for all sufficiently large and agrees with every value established in the paper; the cases and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.