English

Some intersection theorems for finite sets

Combinatorics 2022-05-24 v1

Abstract

Let nn, rr, k1,,krk_1,\ldots,k_r and tt be positive integers with r2r\geq 2, and Fi (1ir)\mathcal{F}_i\ (1\leq i\leq r) a family of kik_i-subsets of an nn-set VV. The families F1, F2,,Fr\mathcal{F}_1,\ \mathcal{F}_2,\ldots,\mathcal{F}_r are said to be rr-cross tt-intersecting if F1F2Frt|F_1\cap F_2\cap\cdots\cap F_r|\geq t for all FiFi (1ir),F_i\in\mathcal{F}_i\ (1\leq i\leq r), and said to be non-trivial if 1irFFiF<t|\cap_{1\leq i\leq r}\cap_{F\in\mathcal{F}_i}F|<t. If the rr-cross tt-intersecting families F1,,Fr\mathcal{F}_1,\ldots,\mathcal{F}_r satisfy F1==Fr=F\mathcal{F}_1=\cdots=\mathcal{F}_r=\mathcal{F}, then F\mathcal{F} is well known as rr-wise tt-intersecting family. In this paper, we describe the structure of non-trivial rr-wise tt-intersecting families with maximum size, and give a stability result for these families. We also determine the structure of non-trivial 22-cross tt-intersecting families with maximum product of their sizes.

Keywords

Cite

@article{arxiv.2205.10789,
  title  = {Some intersection theorems for finite sets},
  author = {Mengyu Cao and Mei Lu and Benjian Lv and Kaishun Wang},
  journal= {arXiv preprint arXiv:2205.10789},
  year   = {2022}
}

Comments

28 pages. arXiv admin note: text overlap with arXiv:2201.06339

R2 v1 2026-06-24T11:24:40.339Z