Shifts of the Stable Kneser Graphs and Hom-Idempotence
Pablo Torres, Mario Valencia-Pabon

TL;DR
This paper investigates the automorphisms and hom-idempotence properties of stable Kneser graphs, revealing their structure, symmetries, and coloring characteristics, and establishing new results on their homomorphism behavior.
Contribution
It characterizes all shifts of s-stable Kneser graphs, proves certain graphs are not weakly hom-idempotent, and shows some are circulant graphs and cores with specific chromatic numbers.
Findings
2-stable Kneser graphs are not weakly hom-idempotent for n ≥ 2k+2.
s-stable Kneser graphs with specific parameters are circulant and hom-idempotent.
Certain s-stable Kneser graphs are cores with chromatic number s+2.
Abstract
A graph is said to be {\em hom-idempotent} if there is a homomorphism from to , and {\em weakly hom-idempotent} if for some there is a homomorphism from to . Larose et al. [{\em Eur. J. Comb. 19:867-881, 1998}] proved that Kneser graphs are not weakly hom-idempotent for , . For , we characterize all the shifts (i.e., automorphisms of the graph that map every vertex to one of its neighbors) of -stable Kneser graphs and we show that -stable Kneser graphs are not weakly hom-idempotent, for , . Moreover, for , we prove that -stable Kneser graphs are circulant graphs and so hom-idempotent graphs. Finally, for , we show that -stable Kneser…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
