Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsEdgeReachable.trans

∀ {V : Type u_1} {G : SimpleGraph V} {k : ℕ} {u v w : V},
  G.IsEdgeReachable k u v → G.IsEdgeReachable k v w → G.IsEdgeReachable k u w
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.EdgeConnectivity
Cited by
1 results in Mathlib
Foundations
Depth 91 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Walk.IsTrail.isEdgeReachable_two_of_isEdgeReachable_two · cited by 1IsTrail.isEdgeReachable_t…Set · cited by 53352SetSimpleGraph · cited by 3072SimpleGraphSym2 · cited by 737Sym2Set.encard · cited by 327Set.encardSimpleGraph.IsEdgeReachable · cited by 24SimpleGraph.IsEdgeReachab…SimpleGraph.Reachable.trans · cited by 11Reachable.transIsEdgeReachable.transCITED BYCITES

Cites6

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

Cited by1

Results whose statement or proof uses this declaration.