Theorem SimpleGraph.Walk.IsPath.eq_penultimate_of_mem_edges

Modification history

2025-12-10 18:38
Mathlib/Combinatorics/SimpleGraph/Paths.lean
feat(Combinatorics/SimpleGraph/Walk): lemmas about the first and last darts/edges (#31416)
Modified SimpleGraph.Walk.IsPath.eq_penultimate_of_mem_edgesView on Github →
2025-11-22 09:03
Mathlib/Combinatorics/SimpleGraph/Paths.lean
feat(SimpleGraph): weaker condition for paths in acyclic graphs (#25814) …
Added SimpleGraph.Walk.IsPath.eq_penultimate_of_mem_edgesView on Github →