Theorems · Theorem · combinatorics
SimpleGraph.Adj.reachable
∀ {V : Type u} {G : SimpleGraph V} {u v : V}, G.Adj u v → G.Reachable u v- Cited by
- 17 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
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.Adjstatement and proof · cited by 1,346
- SimpleGraph.Reachablestatement · cited by 141
- SimpleGraph.Adj.toWalkproof · cited by 22
- SimpleGraph.Walk.reachableproof · cited by 7
Cited by17
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.subgraphOfAdj_connectedproof · cited by 3
- SimpleGraph.isBridge_iff_not_isEdgeReachable_twoproof · cited by 2
- SimpleGraph.ConnectedComponent.connectedComponentMk_eq_of_adjproof · cited by 2
- SimpleGraph.ComponentCompl.mem_of_adjproof · cited by 1
- SimpleGraph.Subgraph.IsMatching.induce_connectedComponentproof · cited by 1
- SimpleGraph.Reachable.of_isUniversalproof · cited by 1
- SimpleGraph.reachable_or_compl_adjproof · cited by 1
- SimpleGraph.reachable_or_reachable_complproof · cited by 1
- SimpleGraph.Reachable.sum_sup_edgeproof · cited by 1
- SimpleGraph.IsAcyclic.dist_ne_of_adjproof · cited by 1
- SimpleGraph.maximal_isAcyclic_iff_reachable_eqproof · cited by 1
- SimpleGraph.lapMatrix_toLinearMap₂'_apply'_eq_zero_iff_forall_reachableproof · cited by 1