Maximum stable sets in analogs of Kneser and complete graphs

We prove an analog of results by Erdős-Ko-Rado and Greenwell-Lovász by characterising the maximum stable sets in special vertex-transitive subgraphs of powers of complete graphs, and proving that these graphs admit a unique optimal vertex colouring, up to permutation of the coordinates.