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 |
Similar Items
-
The Coloring of Square of Subgraphs of Kneser Graphs
by: Jun-Yo Chen, et al.
Published: (2004) -
The t-Tone Coloring of Kneser Graphs KG(n,2)
by: TSAI, CHENG-HSIU, et al.
Published: (2015) -
Baranyai partitions and Kneser graphs
by: Johnson, J. R.
Published: (2003) -
Dominating sets in Kneser graphs
by: Gorodezky, Igor
Published: (2007) -
Dominating sets in Kneser graphs
by: Gorodezky, Igor
Published: (2007)