Coloring Reduced Kneser Graph
碩士 === 國立臺灣大學 === 數學研究所 === 91 === The vertex set of a Kneser graph ${\sf KG}(m,n)$ consists of all $n$-subsets of the set $[m]=\{0, 1, \ldots, m-1\}$. Two vertices are defined to be adjacent if they are disjoint as subsets. A subset of $[m]$ is called $2$-stable if $2 \le |a-b| \le m-2$ for any d...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/71215543441167987572 |