Theorems · Theorem · combinatorics
SimpleGraph.Walk.take_of_length_le
∀ {V : Type u} {G : SimpleGraph V} {u v : V} {n : ℕ} {p : G.Walk u v} (h : p.length ≤ n), p.take n = p.copy ⋯ ⋯- Cited by
- 0 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
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.lengthstatement and proof · cited by 212
- SimpleGraph.Walk.getVertstatement · cited by 114
- SimpleGraph.Walk.Nilproof · cited by 102
- SimpleGraph.Walk.casesOnproof · cited by 59
- SimpleGraph.Walk.copystatement and proof · cited by 56
- SimpleGraph.Walk.takestatement and proof · cited by 27
- SimpleGraph.Walk.cons.congr_simpproof · cited by 15
- SimpleGraph.Walk.getVert_of_length_lestatement and proof · cited by 7
- SimpleGraph.Walk.length_consproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.