论文标题
可观数的旋塞图
Achromatic numbers of Kneser graphs
论文作者
论文摘要
完整的颜色具有任何两个颜色类之间至少具有边缘的属性。诸如Grundy，Chaphromation和Pseudoachromation数字之类的参数来自完整的颜色，并需要一些其他要求。在本文中，我们以$ n $和$ k $的某些值估算了Kneser Graph $ K（N，K）$中的这些数字。我们给出了$ K（n，2）$的可观数量的确切值。
Complete colorings have the property that any two color classes has at least an edge between them. Parameters such as the Grundy, achromatic and pseudoachromatic numbers comes from complete colorings, with some additional requirement. In this paper, we estimate these numbers in the Kneser graph $K(n,k)$ for some values of $n$ and $k$. We give the exact value of the achromatic number of $K(n,2)$.
