Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families
Sang June Lee, Mark Siggers, and Norihide Tokushige

TL;DR
This paper extends the Ahlswede-Khachatrian theorem to cross t-intersecting families, identifying the maximum weighted pairs and characterizing their structure for large t within specific probability ranges.
Contribution
It proves the maximum p-weight for cross t-intersecting families when r=1 and characterizes the unique optimal families for large t within certain probability intervals.
Findings
Maximum p-weight achieved by specific families for large t
Optimal families are isomorphic to ^t_1 in the specified range
Uniqueness of optimal families except at range endpoints
Abstract
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 , 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research
