AFTD Auto-Formalizing Theoretical Domains

exists_conference_graph

def

exists_conference_graph v asserts the existence of a conference graph of order v on Fin v.

Statement

def exists_conference_graph (v : ℕ) : Prop
Defined in
arXiv:2610.36522 Definition 6
Verified
28 Oct 2026
Axioms
none listed
Built on 1
  • is_conference_graphA conference graph is a strongly regular graph srg(v, (v-1)/2, (v-5)/4, (v-1)/4) with v ≡ 1 mod 4.

Read back from the Lean

For a given natural number v, exists_conference_graph v is the proposition that there exists a simple graph G on the vertex set Fin v with decidable adjacency such that G is a strongly regular graph with parameters (v, (v - 1) / 2, (v - 5) / 4, (v - 1) / 4) (using natural number division and subtraction) and v ≡ 1 [MOD 4].

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Existence of a conference graph on Fin v. -/
def exists_conference_graph (v : ℕ) : Prop :=
  ∃ (G : SimpleGraph (Fin v)) (_ : DecidableRel G.Adj),
    is_conference_graph G
See it in the graphDiscuss this resultChallenge it