Achromatic numbers of Kneser graphs

被引：1

作者：

Araujo-Pardo, Gabriela ^{[1
]}

Carlos Diaz-Patino, Juan ^{[1
]}

Rubio-Montiel, Christian ^{[2
]}

机构：

[1] Univ Nacl Autonoma Mexico, Unidad Juriquilla, Inst Matemat, Campus Juriquilla, Queretaro City 76230, Mexico

[2] Univ Nacl Autonoma Mexico, Div Matemat & Ingn, FES Acatlan, Acatlan 53150, Naucalpan De Ju, Mexico

来源：

ARS MATHEMATICA CONTEMPORANEA | 2021年 / 21卷 / 01期

关键词：

Achromatic number; pseudoachromatic number; Grundy number; block designs; geometric type Kneser graphs; CHROMATIC NUMBER; DESIGNS; S3(3;

D O I：

10.26493/1855-3974.2357.373

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Complete vertex colorings have the property that any two color classes have at least an edge between them. Parameters such as the Grundy, achromatic and pseudoachromatic numbers come 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)

引用

页数：13