Ahlswede and Khachatrian’s diametric theorem is a weighted version of their complete intersection theorem, itself an extension of the -intersecting Erd\H{o}s-Ko-Rado theorem. Their intersection theorem says that the maximum size of a family of subsets of , every pair of which intersects in at least elements, is the size of certain trivially intersecting families proposed by Frankl. We address a cross intersecting version of their diametric theorem. Two families and of subsets of are {\em cross -intersecting} if for every and $B \in ABtp$-weight of a element subset of is , and the weight of a family is the sum of the weights of its sets. The weight of a pair of families is the product of the weights of the families. The maximum -weight of a -intersecting family depends on the value of . Ahlswede and Khachatrian showed that for in the range $[\frac{r}{t + 2r - 1}, \frac{r+1}{t + 2r + 1}]pt$-intersecting family is that of the family consisting of all subsets of containing at least elements of the set . In a previous paper we showed a cross -intersecting version of this for large in the case that . In this paper, we do the same in the case that . We show that for in the range $[\frac{1}{t + 1}, \frac{2}{t + 3}]ptt \geq 200^t_1$. Further, we show that except at the endpoints of this range, this is, up to isomorphism, the only pair of -intersecting families achieving this weight.

生成讲解博客的中文版本

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