Theorems · Theorem · combinatorics
SimpleGraph.Walk.IsPath.isContained_pathGraph
∀ {V : Type u_3} {G : SimpleGraph V} {u v : V} {w : G.Walk u v},
w.IsPath → (SimpleGraph.pathGraph (w.length + 1)).IsContained G- Defined in
- Mathlib.Combinatorics.SimpleGraph.Hasse
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
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.lengthstatement · cited by 212
- SimpleGraph.Walk.IsPathstatement and proof · cited by 140
- SimpleGraph.IsContainedstatement · cited by 68
- SimpleGraph.pathGraphstatement · cited by 8
- SimpleGraph.Walk.IsPath.pathGraphCopyproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.