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
- edge_geodesic_transversal_bound_of_edge_cutLet G be a connected simple graph. Let S be a finite set of edges of G that is an edge cut induced by a vertex subset X (meaning there…
- edge_cut_transversal_theoremLet G be a connected simple graph. Let S be a finite set of edges of G of cardinality k that is an edge cut induced by a vertex subset X…
- geodesic_transversal_number_le_edge_geodesic_transversal_numberFor any connected simple graph G that admits a finite edge geodesic transversal, the vertex geodesic transversal number of G is bounded…
- not_edge_geodesic_transversal_bound_of_edge_disjointThe statement
edge_geodesic_transversal_bound_of_edge_disjointis false: The statement is false as formalized because it omits a… - edge_geodesic_transversal_number_corona_k1_card_twoFor every finite type V with Fintype.card V = 2 and every connected simple graph G on V, the edge geodesic transversal number of the…
- edge_geodesic_transversal_number_corona_k1_leFor every finite type V with 2 ≤ Fintype.card V and every connected simple graph G on V, the edge geodesic transversal number of the…
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 }