Maximality of subfields as cliques in Cayley graphs over finite fields

DOI10.5802/alco.291zbMath1528.05034arXiv2209.00864OpenAlexW4386254087MaRDI QIDQ6088378

Chi Hoi Yip

Publication date: 14 December 2023

Published in: Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Cayley graphcharacter summaximal clique

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other character sums and Gauss sums (11T24) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Gauss sums and the maximum cliques in generalized Paley graphs of square order
• On maximal cliques of Cayley graphs over fields
• Van Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields
• Counting sets with small sumset, and the clique number of random Cayley graphs
• CLIQUE NUMBERS OF PALEY GRAPHS
• THE CLIQUE NUMBERS AND CHROMATIC NUMBERS OF CERTAIN PALEY GRAPHS
• An Estimate for Character Sums
• All self-complementary symmetric graphs

This page was built for publication: Maximality of subfields as cliques in Cayley graphs over finite fields