Theorems · Theorem · combinatorics
SimpleGraph.Walk.start_mem_verts_toSubgraph
∀ {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk u v), u ∈ p.toSubgraph.verts- Cited by
- 5 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Subgraph.vertsstatement · cited by 210
- SimpleGraph.Walk.toSubgraphstatement · cited by 49
Cited by6
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.mapToSubgraphstatement · cited by 4
- SimpleGraph.Subgraph.preconnected_iff_forall_exists_walk_subgraphproof · cited by 1
- SimpleGraph.Walk.map_mapToSubgraph_eq_inducestatement · cited by 1
- SimpleGraph.Walk.mapToSubgraph.eq_defstatement and proof · cited by 0
- SimpleGraph.Walk.map_mapToSubgraph_eq_induce_idstatement · cited by 0
- SimpleGraph.Walk.map_mapToSubgraph_homstatement · cited by 0