Erdős–Sós and Kalai's conjecture for Turán numbers of r-trees
Statement
Let , and let be an -tree on vertices. An -tree is an -uniform hypergraph with edges such that, for each , there is some satisfying
Write for the maximum number of edges in an -uniform hypergraph on vertices containing no copy of . Erdős–Sós–Kalai conjecture. For every and every -tree on vertices,
For this is the Erdős–Sós conjecture, while for the source attributes it to Kalai (1984). The paper presents this as an open conjecture in its concluding remarks; the supplied text gives no resolution status.
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.