We say that a set \emph{-intersects} a set if and have at least common elements. A family of sets is said to be \emph{-intersecting} if each set in -intersects any other set in . Families $_1, _2, …, _kare said to be \emph{cross-t-intersecting} if for anyij{1, 2, …, k}i \neq j_i$ -intersects any set in . We prove that for any finite family that has at least one set of size at least , there exists an integer such that for any , both the sum and the product of sizes of any cross--intersecting sub-families (not necessarily distinct or non-empty) of are maxima if for some largest -intersecting sub-family of . We then study the smallest possible value of and investigate the case $k < \kappa$; this includes a cross-intersection result for straight lines that demonstrates that it is possible to have and such that for any , the configuration $_1 = … = _k = $ is neither optimal for the sum nor optimal for the product. We also outline solutions for various important families , and we provide solutions for the case when is a power set.

生成讲解博客的中文版本

生成AI智能校验的中文版本