Theorems · Theorem · combinatorics
SimpleGraph.Walk.IsCycle.reverse
∀ {V : Type u} {G : SimpleGraph V} {u : V} {p : G.Walk u u}, p.IsCycle → p.reverse.IsCycle- Defined in
- Mathlib.Combinatorics.SimpleGraph.Paths
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 51 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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.supportproof · cited by 307
- SimpleGraph.Walk.IsCyclestatement and proof · cited by 91
- SimpleGraph.Walk.IsTrailproof · cited by 62
- SimpleGraph.Walk.reversestatement and proof · cited by 55
- SimpleGraph.Walk.length_reverseproof · cited by 8
- SimpleGraph.Walk.IsTrail.reverseproof · cited by 2
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.IsCycle.getVert_injOn'proof · cited by 2
- SimpleGraph.Walk.isCycle_reverseproof · cited by 1
- SimpleGraph.Walk.IsCycle.isPath_of_append_leftproof · cited by 0
- SimpleGraph.Walk.IsCycle.exists_isCycle_snd_verts_eqproof · cited by 0