Maximality conjecture for the and constructions
Maximality conjecture for the and constructions
Let be an odd prime power, let satisfy , and consider the cliques in produced by the -construction and the -construction. Maximality conjecture. If
then both cliques are maximal. The claim generalises the known maximality result for the corresponding constructions in Paley graphs, while the extension to generalised Paley graphs is stated under these 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.