A graph G is said to be hom-idempotent if there is a homomorphism from G2 to G, and weakly hom-idempotent if for some n≥1 there is a homomorphism from Gn+1 to Gn. Larose et al. (1998) proved that Kneser graphs KG(n,k) are ...

For k,s≥2, the s-stable Kneser graphs are the graphs with vertex set the k-subsets S of {1,…,n} such that the circular distance between any two elements in S is at least s and two vertices are adjacent if and only if the ...