“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
Paper IPM / M / 15243  


Abstract:  
Forintegersn,k,andi,thegeneralizedKnesergraphK(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.
Download TeX format 

back to top 