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 ordinary graphs it is known that any graph $G$ with more edges than theTur{\'a}n number of $K_s$ must contain several copies of $K_s$, and a copy of$K_{s+1}^-$, the complete graph on $s+1$ vertices with one missing edge.Erd\H{o}s asked if the same result is true for $K^3_s$, the complete 3-uniformhypergraph on $s$ vertices.  In this note we show that for small values of $n$, the number of vertices in$G$, the answer is negative for $s=4$. For the second property, that ofcontaining a ${K^3_{s+1}}^-$, we show that for $s=4$ the answer is negative forall large $n$ as well, by proving that the Tur{\'a}n density of ${K^3_5}^-$ isgreater than that of $K^3_4$.

Two questions of Erd\H{o}s on hypergraphs above the Tur{\'a}n threshold}