Canonical-subspace conjecture for maximum cliques in semi-primitive pseudo-Paley graphs

From papers

Let X=PP(q,2d,I)X=PP(q,2d,I) be a semi-primitive pseudo-Paley graph with q=p2rtq=p^{2rt}, where rr is even. A maximum clique is a clique of size ω(X)\omega(X). Canonical-subspace conjecture. If

ω(X)=q,\omega(X)=\sqrt{q},

then every maximum clique in XX is an Fpt\mathbb{F}_{p^t}-affine subspace. This conjecture extends the known Fp\mathbb{F}_p-subspace structure in the odd-rr case and asserts that square-root maximum cliques in the even-rr 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

No solutions have been posted yet.