首页> 外文期刊>Discrete mathematics >Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
【24h】

Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas

机译:相交的家庭,交叉家庭和猜测Febghali,Johnson和Thomas的证据

获取原文
获取原文并翻译 | 示例
       

摘要

A family A of sets is said to be intersecting if every two sets in A intersect. Two families A and B are said to be cross-intersecting if each set in A intersects each set in B. For a positive integer n, let [n] {1, ... , n} and S-n = {A subset of [n] : 1 is an element of A}. We extend the Erdoss-Ko-Rado Theorem by showing that if A and B are non-empty cross-intersecting families of subsets of [n], A is intersecting, and a(0), a(1), ... , a(n), b(0), b(1), ... , b(n) are non-negative real numbers such that a(i) + b(i) = + a(n-i) + b(n-i) and a(n-i) = b(i) for each i = n/2, then
机译:如果每两组相交,则据说一个套装的套装是交叉的。 据说两个家庭A和B如果每个组合在B.对于正整数n中的每个设置中的每个设置,则显示[n] {1,...,n}和sn = {[ n]:1是a}的一个元素。 我们通过表明A和B是[n],a相交的非空交叉族的非空交叉系列,和a(0),a(1),......, a(n),b(0),b(1),...,b(n)是非负实的实数,使得(i)+ b(i)& = + a(ni)+ b (ni)和a(ni)& = b(i)对于每个I& = n / 2,然后

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号