An adverse non-Q graph from the cyclic Latin square of order six
Abstract
The cyclic Latin square graph of order 6 (cells of Z6xZ6 adjacent when sharing a row, column or symbol) has lambda_min = -3 and upsilon = 6, both unchanged after deleting every open neighbourhood, and no isolated vertices, so it is adverse; its stability number is 5 by the transversal parity obstruction, so it is not a Q-graph. This refutes Cardoso-Luz Conjecture 4.2 (survey arXiv:1811.05516, Optimization 69(1) 2020) that all adverse graphs are Q-graphs, also under the JCO 2016 'non complete' reading.
AI-assisted research preprint. The scoped main statement has a Lean certificate; internal AI review is not external journal peer review. Bounded prior-art searches do not certify worldwide priority. See the paper for qualifications and supplementary results not covered by Lean.
Supplementary files
Comments
Submitted by Myeongjin Kang. Original AI-assisted research draft and source proof package; draft preparation and internal campaign-status language in the PDF records its preparation stage. Related MathDB problem 381433. Scope: The cyclic Latin square graph of order 6 (cells of Z6xZ6 adjacent when sharing a row, column or symbol) has lambda_min = -3 and upsilon = 6, both unchanged after deleting every open neighbourhood, and no isolated vertices, so it is adverse; its stability number is 5 by the transversal parity obstruction, so it is not a Q-graph. This refutes Cardoso-Luz Conjecture 4.2 (survey arXiv:1811.05516, Optimization 69(1) 2020) that all adverse graphs are Q-graphs, also under the JCO 2016 'non complete' reading. Attachments: proof-sources.json preserves UTF-8 source files from the accepted proof archive; extract_sources.py reconstructs them. The original archive SHA-256 is recorded in the JSON.