Maximal cliques in the graph of $5$-ary simplex codes of dimension two

Mariusz Kwiatkowski, Andrzej Matraś, Mark Pankov +1

We consider the induced subgraph of the corresponding Grassmann graph formed by $q$-ary simplex codes of dimension $2$, $q\ge 5$. This graph contains precisely two types of maximal…