Exact online size Ramsey number of a triangle versus a path
Statement
Let be the triangle and let be the path on vertices. Write for the minimum number of rounds in the online size Ramsey game in which Builder forces either a red copy of or a blue copy of .
Conjecture on the triangle–path online size Ramsey number.
The paper proves the upper bound and gives a lower bound with asymptotic coefficient , where is the golden ratio. The authors state that they believe the upper bound is sharp for every , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.