AFTD Auto-Formalizing Theoretical Domains

is_conference_graph

def

A conference graph is a strongly regular graph srg(v, (v-1)/2, (v-5)/4, (v-1)/4) with v ≡ 1 mod 4.

Statement

def is_conference_graph {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] : Prop
Defined in
arXiv:2610.36522 Definition 6
Verified
28 Oct 2026
Axioms
none listed
Used by 1

Read back from the Lean

Given a finite type V with decidable equality and a simple graph G on V with decidable adjacency, is_conference_graph G asserts that: 1. G is a strongly regular graph (IsSRGWith) with parameters: - number of vertices: Fintype.card V - degree: (Fintype.card V - 1) / 2 - common neighbors of adjacent vertices: (Fintype.card V - 5) / 4 - common neighbors of non-adjacent vertices: (Fintype.card V - 1) / 4 (all computed using truncated natural number subtraction and integer division). 2. The number of vertices satisfies Fintype.card V % 4 = 1.

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

/-- Predicate for a graph being a conference graph of order v ≡ 1 mod 4. -/
def is_conference_graph {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] : Prop :=
  G.IsSRGWith (Fintype.card V) ((Fintype.card V - 1) / 2) ((Fintype.card V - 5) / 4) ((Fintype.card V - 1) / 4) ∧
    Fintype.card V % 4 = 1
See it in the graphDiscuss this resultChallenge it