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 zaia usage as premium feature

ZAIA

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the access of premium content as premium feature

Premium Content

Zendy Tools

Zendy Open

Recently, several hypergraph Tur\'{a}n problems were solved by the powerfulrandom algebraic method. However, the random algebraic method usually requiressome parameters to be very large, hence we are concerned about how theseTur\'{a}n numbers depend on such large parameters of the forbidden hypergraphs.In this paper, we determine the dependence on such specified large constant forseveral hypergraph Tur\'{a}n problems. More specifically, for complete$r$-partite $r$-uniform hypergraphs, we show that if $s_{r}$ is sufficientlylarger than $s_{1},s_{2},\ldots,s_{r-1},$ then  $$\textup{ex}_{r}(n,K_{s_{1},s_{2},\ldots,s_{r}}^{(r)})=\Theta(s_{r}^{\frac{1}{s_{1}s_{2}\cdotss_{r-1}}}n^{r-\frac{1}{s_{1}s_{2}\cdots s_{r-1}}}).$$  For complete bipartite $r$-uniform hypergraphs, we prove that if $s$ issufficiently larger than $t,$ we have  $$\textup{ex}_{r}(n,K_{s,t}^{(r)})=\Theta(s^{\frac{1}{t}}n^{r-\frac{1}{t}}).$$  In particular, our results imply that the famousK\H{o}v\'{a}ri--S\'{o}s--Tur\'{a}n's upper bound$\textup{ex}(n,K_{s,t})=O(t^{\frac{1}{s}}n^{2-\frac{1}{s}})$ has the correctdependence on large $t$. The main approach is to construct randommulti-hypergraph via a variant of random algebraic method.

Some tight lower bounds for Tur\'{a}n problems via constructions of multi-hypergraphs