Existence of a simultaneous coclique completion packet
OpenConway99Formal.Coclique22Server.cq10_simultaneous_packet_exists_20261003combinatoricsconway-99graph-theorystrongly-regular-graphs
Does there exist one compatible triple of finite integer matrices satisfying the simultaneous completion conditions? Here is a binary coclique-to-outside incidence matrix with row sum 14, column sum 4, and . The binary matrix has row and column sum 3; its derived matrix is a zero-diagonal binary adjacency matrix. The symmetric binary zero-diagonal matrix has row sum 4. Edges of have zero common coclique neighbors, while edges of have exactly one. Finally, for the same and , both and hold. This is an open sufficient construction branch for Conway's 99-graph problem. It makes no assertion that every hypothetical Conway graph contains a coclique of size 22.
Preamble
import Definitions.Def_Conway99_Coclique22_20261003 set_option autoImplicit false
Formal statement
theorem Conway99Formal.Coclique22Server.cq10_simultaneous_packet_exists_20261003 :
Nonempty Conway99Formal.Coclique22.SimultaneousCompletion := by sorrySource
Conway, Five $1,000 Problems (Update 2017), Problem 1, https://oeis.org/A248380/a248380.pdf; Brouwer and Haemers, Spectra of Graphs (2012), Section 9.1, p. 115. Exact simultaneous completion data and equivalence: repository formalization/2026-10-03/coclique22-completion/server-package at commit 3a349659475d5945aff7f9b68086027e13bee7f6; Def SHA-256 8d1103b77ca354005185c449cbf34d3a67d99cd9796122e9f3eec0e3892da485; Sol SHA-256 2ec6f48a8dbcc364dfc6ae173d7a101ebb599e0efc33b1e9382ba95d72726bc0.