Loading...

On the chromatic number of generalized kneser graphs

Jafari, A ; Sharif University of Technology | 2017

107 Viewed
  1. Type of Document: Article
  2. Publisher: University of Calgary , 2017
  3. Abstract:
  4. For integers n, k, and i, the generalized Kneser graph K(n, k, i), is a graph whose vertices are subsets of size k of the set {1, 2, ..., n} and two vertices F and F are connected if and only if their intersection has less than i elements. In this paper we study the chromatic number of this graph. Some new bounds and properties for this chromatic number are derived. © 2017 University of Calgary
  5. Keywords:
  7. Source: Contributions to Discrete Mathematics ; Volume 12, Issue 2 , 2017 , Pages 69-76 ; 17150868 (ISSN)
  8. URL: https://cdm.ucalgary.ca/cdm/index.php/cdm/article/download/557/259