AFTD Auto-Formalizing Theoretical Domains

edge_geodesic_transversal_number

def

The edge geodesic transversal number of a simple graph G is the infimum in ℕ of the set of natural numbers k such that there exists a finite edge geodesic transversal S of G (satisfying is_edge_geodesic_transversal G S) with cardinality k.

Statement

noncomputable def edge_geodesic_transversal_number {V : Type*} (G : SimpleGraph V) : ℕ
Defined in
arXiv:2610.36821 Section 1
Verified
28 Oct 2026
Axioms
none listed
Built on 1
  • is_edge_geodesic_transversalA finite set S of edges of G is an edge geodesic transversal if every maximal geodesic in G contains at least one edge of S.
Used by 6

Read back from the Lean

For a type V and a simple graph G on V, edge_geodesic_transversal_number G is defined as the infimum (in ℕ) of the set of all natural numbers k such that there exists a finite set S of edges (represented as unordered pairs in Sym2 V) of cardinality k that is an edge geodesic transversal of G.

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

/-- The edge geodesic transversal number gt_e(G) of a simple graph G. -/
noncomputable def edge_geodesic_transversal_number {V : Type*} (G : SimpleGraph V) : ℕ := sInf { k : ℕ | ∃ S : Finset (Sym2 V), is_edge_geodesic_transversal G S ∧ S.card = k }
See it in the graphDiscuss this resultChallenge it