Maximality of subfields as cliques in Cayley graphs over finite fields

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.

exposition improved, 5 pages

References in corpus (2)

• Van Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields
• Gauss sums and the maximum cliques in generalized Paley graphs of square order

Cited by in corpus (2)

• Extremal Peisert-type graphs without the strict-EKR property
• Exact values and improved bounds on the clique number of cyclotomic graphs