Theorems · Theorem · combinatorics
SimpleGraph.Walk.start_mem_support
∀ {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk u v), u ∈ p.support- Cited by
- 9 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext
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.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjproof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.supportstatement and proof · cited by 307
- SimpleGraph.Walk.casesOnproof · cited by 59
Cited by10
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.inducestatement · cited by 9
- SimpleGraph.Walk.takeUntil_firststatement · cited by 5
- SimpleGraph.adj_and_reachable_delete_edges_iff_exists_cycleproof · cited by 3
- SimpleGraph.Walk.IsPath.exists_isCycle_sublist_of_neproof · cited by 1
- SimpleGraph.Walk.map_inducestatement · cited by 0
- SimpleGraph.Walk.induce_consstatement · cited by 0
- SimpleGraph.Walk.induce_nilstatement · cited by 0
- SimpleGraph.Walk.map_induce_induceHomOfLEstatement · cited by 0
- SimpleGraph.Walk.support_inducestatement · cited by 0
- SimpleGraph.mem_support_of_reachableproof · cited by 0