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 F of k-element subsets of the n-element set [n] is called intersecting if F ∩F ′ 6= ∅ for all F, F ′ ∈ F . In 1961 Erdős, Ko and Rado showed that |F| 6 ( n−1 k−1 ) if n > 2k. Since then a large number of results providing best possible upper bounds on |F| under further restraints were proved. The paper of Li et al. is one of them. We consider the restricted universeW = { F ∈ ([n] k ) : |F ∩ [m]| > ` } , n > 2k, m > 2` and determine max |F| for intersecting families F ⊂ W. Then we use this result to solve completely the problem considered by Li et al. Mathematics Subject Classifications: 05D05

Erdős–Ko–Rado Theorem for a Restricted Universe