Theorems · Theorem · combinatorics
SimpleGraph.Walk.IsPath.isCycles_spanningCoe_toSubgraph_sup_edge
∀ {V : Type u_1} {G : SimpleGraph V} {u v : V} {p : G.Walk u v},
p.IsPath → u ≠ v → s(v, u) ∉ p.edges → (p.toSubgraph.spanningCoe ⊔ SimpleGraph.edge v u).IsCycles- Cited by
- 0 results in Mathlib
- Foundations
- Depth 103 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites22
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topproof · cited by 9,680
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Walkstatement and proof · cited by 915
- Sym2statement · cited by 737
- Sym2.mkstatement and proof · cited by 332
- SimpleGraph.Walk.edgesstatement and proof · cited by 145
- SimpleGraph.Walk.IsPathstatement and proof · cited by 140
- SimpleGraph.extproof · cited by 59
- SimpleGraph.completeGraphproof · cited by 49
- SimpleGraph.Walk.toSubgraphstatement and proof · cited by 49
- SimpleGraph.edgestatement and proof · cited by 44
- SimpleGraph.subgraphOfAdjproof · cited by 36
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.