Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families
نویسندگان
چکیده
Ahlswede and Khachatrian's diametric theorem is a weighted version of their complete intersection theorem, which is itself a well known extension of the t-intersecting Erd˝ os-Ko-Rado theorem. The complete intersection theorem says that the maximum size of a family of subsets of [n] = {1,. .. , n}, every pair of which intersects in at least t elements, is the size of certain trivially intersecting families proposed by Frankl. We address a cross intersecting version of their diametric theorem. Two families A and B of subsets of [n] are cross t-intersecting if for every A ∈ A and B ∈ B, A and B intersect in at least t elements. The p-weight of a k element subset A of [n] is p k (1 − p) n−k , and the weight of a family A 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 p-weight of a t-intersecting family depends on the value of p. Ahlswede and Khachatrian showed that for p in the range [ r t+2r−1 , r+1 t+2r+1 ], the maximum p-weight of a t-intersecting family is that of the family F t r consisting of all subsets of [n] containing at least t + r elements of the set [t + 2r]. In a previous paper we showed a cross t-intersecting version of this for large t in the case that r = 0. In this paper, we do the same in the case that r = 1. We show that for p in the range [ 1 t+1 , 2 t+3 ] the maximum p-weight of a cross t-intersecting pair of families, for t ≥ 200, is achieved when both families are F t 1. Further, we show that except at the endpoints of this range, this is, up to isomorphism, the only pair of t-intersecting families achieving this weight.
منابع مشابه
Ahlswede–Khachatrian Theorems: Weighted, Infinite, and Hamming
The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families. We extend this theorem to several other settings: the weighted case, the case of infinitely many points, and the Hamming scheme. The weighted Ahlswede–Khachatrian theorem gives the maximal μp measure of a t-inte...
متن کاملAhlswede–Khachatrian theorem
The Erdős–Ko–Rado theorem determines the largest μp-measure of an intersecting family of sets. We consider the analogue of this theorem to t-intersecting families (families in which any two sets have at least t elements in common), following Ahlswede and Khachatrian [1, 2]. We present a proof of the μp version of their theorem, which is adapted from the earlier proofs. Due to the simpler nature...
متن کاملASYMPTOTIC UPPER BOUNDS ON THE SHADES OF t-INTERSECTING FAMILIES
We examine the m-shades of t-intersecting families of k-subsets of [n], and conjecture on the optimal upper bound on their cardinalities. This conjecture extends Frankl’s General Conjecture that was proven true by Ahlswede–Khachatrian. From this we deduce the precise asymptotic upper bounds on the cardinalities of m-shades of t(m)-intersecting families of k(m)subsets of [2m], as m → ∞. A genera...
متن کاملThe weighted complete intersection theorem
The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families for t ≥ 2. We extend this theorem to the weighted setting, in which we consider unconstrained families. The goal in this setting is to maximize the μp measure of the family, where the measure μp is given by μp(A)...
متن کاملMore complete intersection theorems
The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families. In recent work, we extended this theorem to the weighted setting, giving the maximum μp measure of a t-intersecting family on n points. In this work, we prove two new complete intersection theorems. The first gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 216 شماره
صفحات -
تاریخ انتشار 2017