Yip's maximal subfield clique conjecture for generalized Paley graphs
Let be an integer. Let be a power of a prime , and let be the largest integer such that . The subfield is a clique in the generalized Paley graph . Yip's maximal subfield clique conjecture. The subfield forms a maximal clique in . This conjecture asserts that the largest subfield producing a subfield clique cannot be extended to a larger clique. The paper resolves it in a stronger form under a sufficient-size hypothesis, while the unrestricted statement is the conjecture being addressed.
References
2 papers in this index state this conjecture (2021–2022). The statement above is taken from the most recent of them; the others are arXiv:2106.01522.
Source: Chi Hoi Yip, “Maximality of subfields as cliques in Cayley graphs over finite fields”, arXiv:2209.00864 (2022).
Progress summary
A new unverified submission claims the conjecture is false, while the established result proves it only under a size condition.
Yip’s conjecture says that the largest subfield that forms a clique in a generalized Paley graph cannot be enlarged. The unrestricted statement remains unresolved in the established literature.
Known results
- Yip proved cases including cubic Paley graphs of cubic order and quadruple Paley graphs of quartic order.
- Yip’s 2022 paper proves a stronger implication when the base-field size satisfies .
- The same paper reports exhaustive checks for in the remaining small range, and for when .
November 2026 claimed counterexample
A submitted argument claims that for and , the clique is not maximal, which would refute the unrestricted conjecture. The argument is unverified and has no independent mathematical assessment.
Current status (as of November 2026): The conjecture is proved under and in earlier special cases; the unrestricted claim remains open, with only an unverified counterexample submission currently reported.
Solutions 1
The prime field is not a maximal clique in GP(5^8,3): a counterexample to Yip's maximal subfield clique conjectureSee full solution
Result and scope. For q=5^8, d=3 (largest admissible r=1), in every field of order 5^8 the prime field F_5 is a clique of GP(5^8,3) but not maximal (x=2θ+4θ^2+θ^3, f(θ)=0, f=X^8+X^7+2X^6+2). Refutes the unrestricted conjecture; ALCO Theorem 1.2 (q>(n-1)^2) untouched.
Complete proof: The prime field is not a maximal clique in GP(5^8,3): a counterexample to Yip's maximal subfield clique conjecture · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.