On the number of star-shaped classes in optimal colorings of Kneser graphs

被引：0
|
作者：
Daneshpajouh, Hamid Reza [1 ,2 ]
机构：
[1] Univ Nottingham Ningbo China, Sch Math Sci, Ningbo, Peoples R China
[2] Univ Nottingham Ningbo China, Sch Math Sci, 199 Taikang East Rd, Ningbo 315100, Peoples R China
来源：
JOURNAL OF GRAPH THEORY | 2024年 / 105卷 / 02期
关键词：
chromatic number; Kneser graph; line graph; CHROMATIC NUMBER; PROOF;
D O I：
10.1002/jgt.23032
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A family of sets is called star-shaped if all the members of the family have a point in common. The main aim of this paper is to provide a negative answer to the following question raised by Aisenberg et al., for the case k=2 $k=2$. Do there exist (n-2k+2) $(n-2k+2)$-colorings of the (n,k) $(n,k)$-Kneser graphs with more than k-1 $k-1$ many non-star-shaped color classes?
引用
收藏
页码：230 / 238
页数：9
相关论文
共 31 条
1234