ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r≥2r\geq 2, and let TT be an rr-tree on vv vertices. An rr-tree is an rr-uniform hypergraph with edges e1,…,eqe_1,\ldots,e_q such that, for each ii, there is some k<ik<i satisfying

ei∩(⋃j<iej)⊂ek.e_i\cap\left(\bigcup_{j<i}e_j\right)\subset e_k.

Write exr(n,T){\rm ex}_r(n,T) for the maximum number of edges in an rr-uniform hypergraph on nn vertices containing no copy of TT. Erdős–Sós–Kalai conjecture. For every r≥2r\geq 2 and every rr-tree TT on vv vertices,

exr(n,T)≤v−rr(nr−1).{\rm ex}_r(n,T)\leq \frac{v-r}{r}{n\choose r-1}.

For r=2r=2 this is the Erdős–Sós conjecture, while for r≥3r\geq 3 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 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.