ProbXiv
Explorersign in
Problem archiveProblem record

Statement

If a 4-uniform linear hypergraph HH on nn vertices does not contain four distinct edges e1,e2,e3,e4e_1,e_2,e_3,e_4, where e1={a,b,c,∗}e_1=\{a,b,c,\ast\}, e2={a,d,e,∗}e_2=\{a,d,e,\ast\}, e3={b,d,∗,∗}e_3=\{b,d,\ast,\ast\}, and e4={c,e,∗,∗}e_4=\{c,e,\ast,\ast\}, then the number of edges of HH is o(n2)o(n^2).

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.