Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Reachable.mono

∀ {V : Type u} {u v : V} {G G' : SimpleGraph V}, G ≤ G' → G.Reachable u v → G'.Reachable u v
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Cited by
10 results in Mathlib
Foundations
Depth 10 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_of_maximal_isAcyclic · cited by 2SimpleGraph.reachable_eq_…SimpleGraph.Preconnected.mono · cited by 2Preconnected.monoSimpleGraph.IsBridge.of_not_reachable · cited by 1IsBridge.of_not_reachableSimpleGraph.IsBridge.sup_edge_of_not_reachable_of_isBridge · cited by 1IsBridge.sup_edge_of_not_…SimpleGraph.ConnectedComponent.connectedComponentMk_supp_subset_supp · cited by 1ConnectedComponent.connec…SimpleGraph.Preconnected.sum_sup_edge · cited by 1Preconnected.sum_sup_edgeSimpleGraph.Reachable.sum_sup_edge · cited by 1Reachable.sum_sup_edgeSimpleGraph.IsBridge.anti · cited by 1IsBridge.antiSimpleGraph.Reachable.mono' · cited by 0Reachable.mono'SimpleGraph.IsEdgeReachable.mono · cited by 0IsEdgeReachable.monoSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Reachable · cited by 141SimpleGraph.ReachableSimpleGraph.Hom.ofLE · cited by 27Hom.ofLESimpleGraph.Reachable.map · cited by 14Reachable.mapReachable.monoCITED BYCITES

Cites4

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

Cited by10

Results whose statement or proof uses this declaration.