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/

Zendy Plus

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

Zendy Tools

Zendy Open

Let $B_i^{(k)}$ be the $k$-uniform hypergraph whose vertex set is of the form $S\cup T$, where $|S|=i$, $|T|=k-1$, and $S\cap T=\emptyset$, and whose edges are the $k$-subsets of $S\cup T$ that contain either $S$ or $T$. We derive upper and lower bounds for the Turan density of $B_i^{(k)}$ that are close to each other as $k\to\infty$. We also obtain asymptotically tight bounds for the Turan density of several other infinite families of hypergraphs. The constructions that imply the lower bounds are derived from elementary number theory by probabilistic arguments, and the upper bounds follow from some results of de Caen, Sidorenko, and Keevash.

Turán Densities of Some Hypergraphs Related to $K_{k+1}^{k}$