The List Distinguishing Number of Kneser Graphs

Niranjan Balachandran, Sajith Padinhatteeri

A graph $G$ is said to be $k$-distinguishable if the vertex set can be colored using $k$ colors such that no non-trivial automorphism fixes every color class, and the distinguishin…