On the chromatic number ofq-Kneser graphs
✍ Scribed by A. Blokhuis, A. E. Brouwer, T. Szőnyi
- Book ID
- 118298949
- Publisher
- Springer
- Year
- 2011
- Tongue
- English
- Weight
- 163 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0925-1022
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We investigate the relation between the multichromatic number (discussed by Stahl and by Hilton, Rado and Scott) and the star chromatic number (introduced by Vince) of a graph. Denoting these by χ \* and η \* , the work of the above authors shows that χ \* (G) = η \* (G) if G is bipartite, an odd cy
## Abstract The vertex set of the reduced Kneser graph KG~2~(__m,2__) consists of all pairs {__a,b__} such that __a, b__ε{1,2,…,__m__} and 2≤|__a__−__b__|≤__m__−2. Two vertices are defined to be adjacent if they are disjoint. We prove that, if __m__≥4 __and m__≠5, then the circular chromatic number