Theorems · Theorem · combinatorics
SimpleGraph.Walk.concat_dropLast
∀ {V : Type u} {G : SimpleGraph V} {u v : V} {p : G.Walk u v} (hp : G.Adj p.penultimate v), p.dropLast.concat hp = p- Cited by
- 2 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses propext
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.Adjstatement and proof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.casesOnproof · cited by 59
- SimpleGraph.Walk.penultimatestatement and proof · cited by 48
- SimpleGraph.Walk.concatstatement and proof · cited by 34
- SimpleGraph.Walk.dropLaststatement and proof · cited by 20
- SimpleGraph.Walk.cons.congr_simpproof · cited by 15
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.support_dropLast_concatproof · cited by 2
- SimpleGraph.Walk.length_dropLast_add_oneproof · cited by 1