Theorems · Theorem · combinatorics
SimpleGraph.Walk.reachable
∀ {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk u v), G.Reachable u v- Cited by
- 7 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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.Reachablestatement · cited by 141
Cited by8
Results whose statement or proof uses this declaration.
- SimpleGraph.Adj.reachableproof · cited by 17
- SimpleGraph.ConnectedComponent.reachable_toSimpleGraphproof · cited by 1
- SimpleGraph.exists_isTutteViolatorproof · cited by 1
- SimpleGraph.exists_adj_isEdgeReachable_twoproof · cited by 1
- SimpleGraph.isTree_iff_existsUnique_pathproof · cited by 1
- SimpleGraph.length_eq_dist_of_subwalkproof · cited by 0
- SimpleGraph.ConnectedComponent.recOnstatement · cited by 0
- SimpleGraph.IsHamiltonian.connectedproof · cited by 0