The asymptotic and exact online Ramsey conjecture for paths
Statement
Let denote the path on vertices, and let denote the online Ramsey number for the pair of graphs and .
Path Ramsey conjecture. For ,
Moreover, for all integers ,
In particular,
For fixed , the paper gives only bounds between and for the limiting ratio, so both the asymptotic value and the proposed exact formula remain 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.