Theorem SimpleGraph.Walk.adj_of_length_eq_one

Modification history

2024-05-24 20:28
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean
feat(Combinatorics/SimpleGraph): Distance between `u` and `v` is one iff `u` and `v` are adjacent (#11945) …
Added SimpleGraph.Walk.adj_of_length_eq_oneView on Github →