ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a (u,u−4)(u,u-4)-free hypergraph with nn vertices, meaning that it contains no collection of u−4u-4 edges spanned by at most uu vertices.

(u,u−4)(u,u-4)-free hypergraph power-bound conjecture. For every uu there exists ϵ>0\epsilon>0 such that GG has at most

O(n2−ϵ)O(n^{2-\epsilon})

edges.

The conjecture concerns stronger forbidden-configuration conditions than the Brown–Erdős–Sós (u,u−3)(u,u-3)-free condition. The surrounding discussion presents the power bound as a plausible strengthening, conditional in motivation on the Brown–Erdős–Sós conjecture.

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.