Some intersection theorems for finite sets
Abstract
Let n, r, k1,…,kr and t be positive integers with r≥ 2, and Fi\ (1≤ i≤ r) a family of ki-subsets of an n-set V. The families F1,\ F2,…,Fr are said to be r-cross t-intersecting if |F1 F2·s Fr|≥ t for all Fi∈Fi\ (1≤ i≤ r), and said to be non-trivial if |1≤ i≤ rF∈FiF|<t. If the r-cross t-intersecting families F1,…,Fr satisfy F1=·s=Fr=F, then F is well known as r-wise t-intersecting family. In this paper, we describe the structure of non-trivial r-wise t-intersecting families with maximum size, and give a stability result for these families. We also determine the structure of non-trivial 2-cross t-intersecting families with maximum product of their sizes.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.