The exact 3-partite path Ramsey conjecture
Statement
Let be the complete tripartite graph with three parts of size , and let denote the path on vertices. For graphs , write if every 2-coloring of the edges of contains a copy of whose edges all have color for some . Exact 3-partite path Ramsey conjecture. For every positive integer ,
This conjecture asks for the exact strengthening of the previously known asymptotic bound ; its resolution is not indicated in the supplied source context.
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.