2023/08/11 by Mariusz Kwiatkowski, Kwiatkowski, Mariusz, Mark Pankov +1 · 1 citation
Computer Science · #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Mathematics #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.2308.06109
openalex publication_date 2023/08/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The induced subgraph of the corresponding Grassmann graph formed by simplex codes is considered. We show that this graph, as the Grassmann graph, contains two types of maximal cliques. For any two cliques of the first type there is a monomial linear automorphism transferring one of them to the other. Cliques of the second type are more complicated and can contain different numbers of elements.