Canonical-subspace conjecture for maximum cliques in semi-primitive pseudo-Paley graphs
Canonical-subspace conjecture for maximum cliques in semi-primitive pseudo-Paley graphs
Let be a semi-primitive pseudo-Paley graph with , where is even. A maximum clique is a clique of size . Canonical-subspace conjecture. If
then every maximum clique in is an -affine subspace. This conjecture extends the known -subspace structure in the odd- case and asserts that square-root maximum cliques in the even- case have the corresponding canonical subfield structure. The source presents this as open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Shamil Asgarli and Chi Hoi Yip, “The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes”, arXiv:2110.07176 (2024).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.