Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Z. Füredi and D. Gerbner, Hypergraphs without exponents, J. Combin. Theory Ser. A 184 (2021), Paper No. 105517, doi:10.1016/j.jcta.2021.105517. Labels and pages are those of the arXiv preprint arXiv:1906.06657v1 named on the source card.

Statement

Problem (p. 3, quoted). "Determine lim sup⁡n→∞exk(n,Qk(r))/nk−1\limsup_{n\to\infty}\mathrm{ex}_k(n,Q_k(r))/n^{k-1} for 4≤k≤2r−24\leq k\leq 2r-2."

Here Qk(r)Q_k(r) is the hypergraph of Definition 3.2 (p. 2), stated on the page of Theorem 3.3. For k≥r≥3k\ge r\ge3 the range k≤2r−2k\le2r-2 is the range r≥(k/2)+1r\ge(k/2)+1, where Theorem 3.3 gives exk(n,Qk(r))=Θ(nk−1)\mathrm{ex}_k(n,Q_k(r))=\Theta(n^{k-1}), so the problem asks for the constant.

Proof pointer

Posed as open.

Read depth

Claims checked: read on the page image of p. 3 of the preprint.