Abstract
Ahlswede and Khachatrian's diametric theorem is a weighted version of their complete intersection theorem, itself an extension of the -intersecting Erdő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 , and intersect in at least elements. The -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 , the maximum -weight of a -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 the maximum -weight of a cross -intersecting pair of families, for , is achieved when both families are . 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.