Theorems · Theorem · combinatorics
SimpleGraph.Walk.IsPath.bypass_eq_self
∀ {V : Type u} {G : SimpleGraph V} {u v : V} [inst : DecidableEq V] {p : G.Walk u v}, p.IsPath → p.bypass = p- Defined in
- Mathlib.Combinatorics.SimpleGraph.Paths
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 25 from the axioms · uses propext, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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.Adjproof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.supportproof · cited by 307
- SimpleGraph.Walk.IsPathstatement and proof · cited by 140
- SimpleGraph.Walk.bypassstatement and proof · cited by 20
- SimpleGraph.Walk.cons.congr_simpproof · cited by 15
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.