Theorems · Theorem · combinatorics
SimpleGraph.Walk.length_reverse
∀ {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk u v), p.reverse.length = p.length- Cited by
- 8 results in Mathlib
- Foundations
- Depth 19 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- add_zeroproof · cited by 2,707
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.lengthstatement and proof · cited by 212
- SimpleGraph.Walk.reversestatement · cited by 55
- SimpleGraph.Walk.length_reverseAuxproof · cited by 1
Cited by8
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.getVert_reverseproof · cited by 4
- SimpleGraph.edist_commproof · cited by 4
- SimpleGraph.Walk.IsCycle.reverseproof · cited by 4
- SimpleGraph.Walk.IsCycle.getVert_injOn'proof · cited by 2
- SimpleGraph.Walk.penultimate_reverseproof · cited by 1
- SimpleGraph.two_colorable_iff_forall_loop_evenproof · cited by 0
- SimpleGraph.Walk.IsPath.neighborSet_toSubgraph_endpointproof · cited by 0
- SimpleGraph.Walk.IsPath.getVert_eq_end_iffproof · cited by 0