Theorems · Definition · combinatorics
SimpleGraph.Adj.toWalk
{V : Type u} → {G : SimpleGraph V} → {u v : V} → G.Adj u v → G.Walk u vThe one-edge walk associated to a pair of adjacent vertices.
- Cited by
- 22 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- SimpleGraph.Walkstatement · cited by 915
Cited by23
Results whose statement or proof uses this declaration.
- SimpleGraph.Adj.reachableproof · cited by 17
- SimpleGraph.edist_eq_one_iff_adjproof · cited by 5
- SimpleGraph.walkLengthTwoEquivCommonNeighborsproof · cited by 3
- SimpleGraph.isAcyclic_iff_subsingleton_pathproof · cited by 3
- SimpleGraph.Walk.isSubwalk_toWalk_iff_mem_dartsstatement · cited by 2
- SimpleGraph.Walk.IsPath.of_adjstatement · cited by 2
- SimpleGraph.Walk.isSubwalk_toWalk_iff_mem_edgesstatement and proof · cited by 1
- SimpleGraph.Walk.exists_length_eq_one_iffproof · cited by 1
- SimpleGraph.IsCycles.reachable_deleteEdgesproof · cited by 1
- SimpleGraph.Adj.toWalk.congr_simpstatement and proof · cited by 0
- SimpleGraph.Walk.reverse_toWalkstatement · cited by 0
- SimpleGraph.Walk.isSubwalk_toWalk_adj_iff_mem_dartsstatement · cited by 0