The power-bound conjecture for (u,u-4)-free hypergraphs
Statement
Let be a -free hypergraph with vertices, meaning that it contains no collection of edges spanned by at most vertices.
-free hypergraph power-bound conjecture. For every there exists such that has at most
edges.
The conjecture concerns stronger forbidden-configuration conditions than the Brown–Erdős–Sós -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.