Abstract
Blokhuis showed that all maximum cliques in Paley graphs of square order have a subfield structure. Recently, it has been shown that in Peisert-type graphs, all maximum cliques are affine subspaces, and yet some maximum cliques do not arise from a subfield. In this paper, we investigate the existence of a clique of size q with a subspace structure in pseudo-Paley graphs of order q from unions of semi-primitive cyclotomic classes. We show that such a clique must have an equal contribution from each cyclotomic class and that most such pseudo-Paley graphs do not admit such cliques, suggesting that the Delsarte bound q on the clique number can be improved in general. We also prove that generalized Peisert graphs are not isomorphic to Paley graphs or Peisert graphs, confirming a conjecture of Mullin.
Author supplied keywords
Cite
CITATION STYLE
Asgarli, S., & Yip, C. H. (2024). The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes. Finite Fields and Their Applications, 99. https://doi.org/10.1016/j.ffa.2024.102492
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.