Theorems · Definition · combinatorics
SimpleGraph.Walk.append
{V : Type u} → {G : SimpleGraph V} → {u v w : V} → G.Walk u v → G.Walk v w → G.Walk u wThe concatenation of two compatible walks.
- Cited by
- 95 results in Mathlib
- Foundations
- Depth 7 from the axioms, rests on 17 definitions · 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.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.brecOnproof · cited by 15
Cited by98
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.IsSubwalkproof · cited by 46
- SimpleGraph.Walk.concatproof · cited by 34
- SimpleGraph.Walk.rotateproof · cited by 25
- SimpleGraph.Walk.take_specstatement and proof · cited by 18
- SimpleGraph.Reachable.transproof · cited by 11
- SimpleGraph.Walk.reverse_consstatement · cited by 11
- SimpleGraph.Walk.support_appendstatement and proof · cited by 11
- SimpleGraph.Walk.append_nilstatement and proof · cited by 10
- SimpleGraph.Walk.length_appendstatement and proof · cited by 8
- SimpleGraph.Walk.isSubwalk_iff_support_isInfixproof · cited by 7
- SimpleGraph.Walk.reverse_reverseproof · cited by 6
- SimpleGraph.Walk.isPath_of_isSubwalkproof · cited by 5