On the number of star-shaped classes in optimal colorings of Kneser graphs
arXiv:2201.05605
Abstract
A family of sets is called star-shaped if all the members of the family have a point in common. The main aim of this paper is to provide a negative answer to the following question raised by James Aisenberg et al [Short proofs of the kneser-Lovasz coloring principle, Information and Computation, 261:296-310, 2018.], for the case k=2.