AFTD Auto-Formalizing Theoretical Domains

three_graph_link

def

The link graph of a vertex i in a 3-uniform hypergraph F: two distinct vertices j, k are adjacent iff {i, j, k} is an edge of F.

Statement

def three_graph_link {V : Type*} [DecidableEq V] (F : Finset (Finset V)) (i : V) : SimpleGraph V
Defined in
arXiv:2610.11642 (A counterexample to the bipartite-link conjecture for 3-graphs), Sec. 1 (vertex link graph ∂_i F of a 3-graph).
Verified
09 Oct 2026
Axioms
none listed
Used by 3

Lean source view module on GitHub

/-- The link graph of the vertex `i` in a 3-uniform hypergraph `F` (a family of 3-sets): distinct `j, k` are adjacent iff `{i, j, k} ∈ F`. -/
def three_graph_link {V : Type*} [DecidableEq V] (F : Finset (Finset V)) (i : V) : SimpleGraph V :=
  SimpleGraph.fromRel (fun j k => ({i, j, k} : Finset V) ∈ F)
See it in the graphDiscuss this resultChallenge it