Theorems · Theorem · combinatorics
SimpleGraph.Walk.drop_add_eq
∀ {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk u v) (n m : ℕ), p.drop (n + m) = ((p.drop n).drop m).copy ⋯ ⋯- Cited by
- 1 results in Mathlib
- Foundations
- Depth 18 from the axioms · uses propext
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.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.getVertstatement · cited by 114
- SimpleGraph.Walk.copystatement · cited by 56
- SimpleGraph.Walk.dropstatement and proof · cited by 30
- SimpleGraph.Walk.drop_getVertstatement · cited by 4
- SimpleGraph.Walk.drop_add_heqproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.IsCycle.isPath_dropproof · cited by 0