Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.reachable_iff_reflTransGen

∀ {V : Type u} {G : SimpleGraph V} (u v : V), G.Reachable u v ↔ Relation.ReflTransGen G.Adj u v
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Cited by
3 results in Mathlib
Foundations
Depth 9 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.reachable_eq_reflTransGen · cited by 1SimpleGraph.reachable_eq_…SimpleGraph.hasse_preconnected_of_succ · cited by 1SimpleGraph.hasse_preconn…SimpleGraph.hasse_preconnected_of_pred · cited by 0SimpleGraph.hasse_preconn…SimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.Walk · cited by 915SimpleGraph.WalkSimpleGraph.Reachable · cited by 141SimpleGraph.ReachableRelation.ReflTransGen · cited by 104Relation.ReflTransGenRelation.ReflTransGen.single · cited by 26ReflTransGen.singleRelation.ReflTransGen.trans · cited by 12ReflTransGen.transSimpleGraph.Reachable.trans · cited by 11Reachable.transSimpleGraph.Reachable.refl · cited by 10Reachable.reflSimpleGraph.reachable_iff_ref…CITED BYCITES

Cites9

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by3

Results whose statement or proof uses this declaration.