中文

几乎稳定Kneser超图的色数

组合数学 2009-12-25 v1

摘要

V(n,k,s)V(n,k,s)[n][n]中满足对所有i,jSi,j\in Sijs|i-j|\geq skk元子集SS的集合。我们将几乎ss-稳定Kneser超图KGr([n]k)s-stabKG^r{{[n]}\choose k}_{s{\tiny{\textup{-stab}}}}^{\displaystyle\sim}定义为以V(n,k,s)V(n,k,s)为顶点集、以V(n,k,s)V(n,k,s)中不相交元素的rr元组为边的rr一致超图。借助ZpZ_p-Tucker引理,我们证明,对于素数pp和任意nkpn\geq kp,几乎2-稳定Kneser超图KGp([n]k)2-stabKG^p {{[n]}\choose k}_{2{\tiny{\textup{-stab}}}}^{\displaystyle\sim}的色数等于通常Kneser超图KGp([n]k)KG^p{{[n]}\choose k}的色数,即等于n(k1)pp1\lceil\frac{n-(k-1)p}{p-1}\rceil。定义μ(r)\mu(r)rr的素因子个数(计重数),该结果意味着,对于任意nkrn\geq kr,几乎2μ(r)2^{\mu(r)}-稳定Kneser超图KGr([n]k)2μ(r)-stabKG^r{{[n]}\choose k}_{2^{\mu(r)}{\tiny{\textup{-stab}}}}^{\displaystyle\sim}的色数等于通常Kneser超图KGr([n]k)KG^r{{[n]}\choose k}的色数,即等于n(k1)rr1\lceil\frac{n-(k-1)r}{r-1}\rceil

关键词

引用

@article{arxiv.0912.4748,
  title  = {The chromatic number of almost stable Kneser hypergraphs},
  author = {Frédéric Meunier},
  journal= {arXiv preprint arXiv:0912.4748},
  year   = {2009}
}