arrows_num_markable_edges
def
The number of markable edges of a finite simple graph T is the number of edges in T that are not pendant (neither of whose endpoints has degree 1 in T).
Statement
noncomputable def arrows_num_markable_edges {V : Type*} [Fintype V] [DecidableEq V] (T : SimpleGraph V) [DecidableRel T.Adj] : ℕ
- Defined in
- arXiv:2610.15145 Section 2.2
- Verified
- 24 Oct 2026
- Axioms
- none listed
Read back from the Lean
For a finite type V with decidable equality and a simple graph T on V with decidable adjacency, arrows_num_markable_edges T is the number of edges {u, v} of T such that neither endpoint has degree 1 in T (that is, T.degree u ≠ 1 and T.degree v ≠ 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
/-- The number of markable (non-pendant) edges in a graph T. -/ noncomputable def arrows_num_markable_edges {V : Type*} [Fintype V] [DecidableEq V] (T : SimpleGraph V) [DecidableRel T.Adj] : ℕ := (@Finset.filter (Sym2 V) (fun e => e.lift ⟨fun u v => T.degree u ≠ 1 ∧ T.degree v ≠ 1, by intro u v exact propext and_comm⟩) (Classical.decPred _) T.edgeFinset).card