论文标题
最大值非平凡交叉交流家庭的大小总和
On the maximum of the sum of the sizes of non-trivial cross-intersecting families
论文作者
论文摘要
我们认为标准N-set的K群k子家族。 如果F的每个成员与G的每个成员都有非空的交叉路口，则两个家庭F，G被互相交交。假设F和G是非平地和交叉交流，我们确定| f |+| g |的最大值。为了证明，引入了所谓的转移技术的加强版本。也解决了不同统一家庭的相应问题。
We consider families of k-subsets of the standard n-set. Two families F, G are said to be cross-intersecting if every member of F has non-empty intersection with every member of G. A family is called non-trivial if the intersection of all its members is empty. Supposing that F and G are non-trivial and cross-intersecting, we determine the maximum of |F|+|G|. For the proof a strengthened version of the so-called shifting technique is introduced. The corresponding problem for families of different uniformities is solved as well.
