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

A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a$t$-intersecting family if $|F\cap G| \geq t$ for any two members $F, G \in\mathcal{F}$ and for some positive integer $t$. If $t=1$, then we call thefamily $\mathcal{F}$ to be intersecting. Define the set$\mathcal{I}(\mathcal{F}) = \{F\cap G: F, G \in \mathcal{F} \text{ and } F \neqG\}$ to be the collection of all distinct intersections of $\mathcal{F}$.Frankl et al. proved an upper bound for the size of $\mathcal{I}(\mathcal{F})$of intersecting families $\mathcal{F}$ of $k$-subsets of $\{1,2,\ldots,n\}$.Their theorem holds for integers $n \geq 50 k^2$. In this article, we prove anupper bound for the size of $\mathcal{I}(\mathcal{F})$ of $t$-intersectingfamilies $\mathcal{F}$, provided that $n$ exceeds a certain number $f(k,t)$.Along the way we also improve the threshold $k^2$ to $k^{3/2+o(1)}$ for theintersecting families.

An improved threshold for the number of distinct intersections of intersecting families