ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Kn,n,nK_{n,n,n} be the complete tripartite graph with three parts of size nn, and let PmP_m denote the path on mm vertices. For graphs G0,G1,G2G_0,G_1,G_2, write G0↦(G1,G2)G_0\mapsto(G_1,G_2) if every 2-coloring of the edges of G0G_0 contains a copy of GiG_i whose edges all have color ii for some i∈{1,2}i\in\{1,2\}. Exact 3-partite path Ramsey conjecture. For every positive integer nn,

Kn,n,n↦(P2n+1,P2n+1).K_{n,n,n}\mapsto(P_{2n+1},P_{2n+1}).

This conjecture asks for the exact strengthening of the previously known asymptotic bound Kn,n,n↦(P2n−o(n),P2n−o(n))K_{n,n,n}\mapsto(P_{2n-o(n)},P_{2n-o(n)}); 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 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.