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 a positive integer $d\geq 2$, a family $\mathcal F\subseteq\binom{[n]}{k}$ is said to be d-wise intersecting if $|F_1\cap F_2\cap\dots\cap F_d|\geq 1$ for all $F_1, F_2, \dots ,F_d\in \mathcal F$. A d-wiseintersecting family $\mathcal F\subseteq \binom{[n]}{k}$ is called maximal if$\mathcal F\cup\{A\}$ is not d-wise intersecting for any$A\in\binom{[n]}{k}\setminus\mathcal F$. We provide a refinement of O'Neill andVerstra\"{e}te's Theorem about the structure of the largest and the secondlargest maximal non-trivial d-wise intersecting k-uniform families. We alsodetermine the structure of the third largest and the fourth largest maximalnon-trivial d-wise intersecting k-uniform families for any $k>d+1\geq 4$, andthe fifth largest and the sixth largest maximal non-trivial 3-wise intersectingk-uniform families for any $k\geq 5$, in the asymptotic sense. Our proofs areapplications of the $\Delta$-system method.

The structure of maximal non-trivial d-wise intersecting uniform families with large sizes