Hedetniemi's conjecture from the topological viewpoint

On the number of star‐shaped classes in optimal colorings of Kneser graphs

“…About two decades later, Lovász [13] proved Kneser's conjecture by taking an extraordinary approach, using tools from algebraic topology. Since then, a lot of attention has been drawn to study various problems related to this conjecture, including a large number of new proofs, such as [5,10,12,14], and many generalizations, such as [2,4,6,7,9,11,15]. In particular, Aisenberg et al [1] gave a new proof of this conjecture using a simple counting argument based on the Hilton-Milner theorem, for all but finitely many cases.…”