Neighbour-transitive codes in Kneser graphs

DOI10.1016/j.jcta.2023.105850arXiv2307.09752MaRDI QIDQ6201495

Nina Mostarac, Daniel R. Hawtin, Dean Crnković, Andrea Švob

Publication date: 21 February 2024

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.09752

zbMATH Keywords

Kneser graph; completely transitive code; neighbour-transitive code

Mathematics Subject Classification ID

20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

94B25: Combinatorial codes

05E18: Group actions on combinatorial structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect codes in Doob graphs
• On sets with few intersection numbers in finite projective and affine spaces
• Completely transitive codes in Hamming graphs
• On the classification of binary completely transitive codes with almost-simple top-group
• Sporadic neighbour-transitive codes in Johnson graphs
• Minimal binary 2-neighbour-transitive codes
• Neighbour-transitive codes in Johnson graphs
• Perfect codes in graphs
• Neighbour-transitive codes and partial spreads in generalised quadrangles
• Nonexistence of completely transitive codes with error-correcting capability e<3
• Perfect Codes in Cayley Graphs
• Transitive $t$-designs and strongly regular graphs constructed from linear groups $L(2,q)$, $q leq 23$
• On completely regular codes