Maximality of subfields as cliques in Cayley graphs over finite fields
classification
🧮 math.CO
math.NT
keywords
graphscayleycliquesfinitemaximalitysubfieldsadditiveconfirms
read the original abstract
We show the maximality of subfields as cliques in a special family of Cayley graphs defined on the additive group of a finite field. In particular, this confirms a conjecture of Yip on generalized Paley graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.