Maximality conjecture for the and constructions
Maximality conjecture for the and constructions
Let be an odd prime power and let divide . The -construction and the -construction produce cliques in the generalised Paley graph , with their precise forms depending on whether divides . Maximality conjecture. If
then the cliques from the -construction and the -construction are maximal. This extends the corresponding maximality results known for Paley graphs of square order to generalised Paley graphs under additional assumptions.
Sources & referencesView supporting material
Primary source
Sergey Goryainov, Leonid Shalaginov and Chi Hoi Yip, “On eigenfunctions and maximal cliques of generalised Paley graphs of square order”, arXiv:2203.16081 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.