Theorems · Theorem · combinatorics
SimpleGraph.Walk.IsCycle.isPath_drop
∀ {V : Type u} {G : SimpleGraph V} {u : V} {n : ℕ} {p : G.Walk u u}, p.IsCycle → 0 < n → (p.drop n).IsPath- Defined in
- Mathlib.Combinatorics.SimpleGraph.Paths
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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.IsPathstatement and proof · cited by 140
- SimpleGraph.Walk.getVertstatement and proof · cited by 114
- SimpleGraph.Walk.IsCyclestatement and proof · cited by 91
- SimpleGraph.Walk.dropstatement and proof · cited by 30
- SimpleGraph.Walk.drop_getVertproof · cited by 4
- SimpleGraph.Walk.IsCycle.isPath_tailproof · cited by 4
- SimpleGraph.Walk.drop_add_eqproof · cited by 1
- SimpleGraph.Walk.IsPath.dropproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.