ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A 33-graph FF is linear if any two of its edges share at most one vertex. For fixed FF, let r(F,Kn(3))r(F,K_n^{(3)}) be the least NN such that every red-blue coloring of KN(3)K_N^{(3)} contains a red copy of FF or a blue copy of Kn(3)K_n^{(3)}. Polynomial-exponent upper-bound conjecture. There is an absolute constant C>0C>0 such that, for every fixed linear 33-graph FF,

r(F,Kn(3))≤2OF(nC).r(F,K_n^{(3)})\le 2^{O_F(n^C)}.

The source records this as a proposed uniform upper bound. It follows stronger bounds for linear FF from existing methods, but does not establish an absolute exponent valid for every fixed linear 33-graph.

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.