English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For fixed integers $r\ge 3, e\ge 3$, and $v\ge r+1$, let $f_r(n,v,e)$ denotethe maximum number of edges in an $n$-vertex $r$-uniform hypergraph in whichthe union of arbitrary $e$ distinct edges contains at least $v+1$ vertices. In1973, Brown, Erd\H{o}s and S\'os proved that $f_r(n,er-(e-1)k,e)=\Theta(n^k)$and conjectured that the limit$\lim_{n\rightarrow\infty}\frac{f_3(n,e+2,e)}{n^2}$ always exists for all fixedintegers $e\ge 3$. In 2020 Shangguan and Tamo conjectured that the limit$\lim_{n\rightarrow\infty}\frac{f_r(n,er-(e-1)k,e)}{n^k}$ always exists for allfixed integers $r>k\ge 2$ and $e\ge 3$, which contains the BES conjecture as aspecial case for $r=3, k=2$. Recently, based on a result of Glock, Joos, Kim,K\"uhn, Lichev, and Pikhurko, Delcourt and Postle proved the BES conjecture.Extending their result, we show that the limit$\lim_{n\rightarrow\infty}\frac{f_r(n,er-2(e-1),e)}{n^2}$ always exists,thereby proving the BES conjecture for every uniformity.

Degenerate Tur\'an densities of sparse hypergraphs II: a solution to the Brown-Erd\H{o}s-S\'os problem for every uniformity