ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Improve the bounds. Is it o(t2)o(t^2)? Perhaps the lower bound is the truth.

\emph{Related results:}

(Phelps--R"odl) r3(P2,Kt)=Θ(t2/log⁡t)r_3(P_2, K_t) = \Theta(t^2/\log t). This is the same as giving the minimum independence number of a linear triple system on nn points.

(Mubayi--Cooper) r3(Ps,Kt)=Θ(t2)r_3(P_s,K_t) = \Theta(t^2) for fixed s≥4s \geq 4

Here is the construction giving the lower bound for r3(Ps,K4)r_3(P_s,K_4) for s≥4s \geq 4. Consider the 3-uniform t2t^2-vertex hypergraph with the vertex set being points of a t×tt \times t grid, i.e., V=[t]×[t]V = [t] \times [t], and three points form an edge if and only if they form an L-shape, i.e.,

{(x1,y2),(x1,y1),(x2,y1)}for all 1≤x1<x2≤t and 1≤y1<y2≤t.\{(x_1,y_2),(x_1,y_1),(x_2,y_1)\} \quad \text{for all } 1 \le x_1 < x_2 \le t \text{ and } 1 \le y_1 < y_2 \le t.

This hypergraph has independence number 2t−12t -1 and is P4P_4-free.

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.