Mathlib Map

Theorems · Definition · combinatorics

Quiver.IsStronglyConnected

(V : Type u_2) → [Quiver V] → Prop

Strong connectivity: every ordered pair of vertices is joined by a (possibly empty) directed path.

Defined in
Mathlib.Combinatorics.Quiver.ConnectedComponent
Cited by
5 results in Mathlib
Foundations
Depth 2 from the axioms · uses no axioms
Assumes
Quiver
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Quiver.isStronglyConnected_iff · cited by 0Quiver.isStronglyConnecte…Quiver.IsSStronglyConnected.isStronglyConnected · cited by 0IsSStronglyConnected.isSt…Quiver.IsStronglyConnected.isSStronglyConnected_of_hom · cited by 0IsStronglyConnected.isSSt…Quiver.IsStronglyConnected.isStronglyConnected_symmetrify · cited by 0IsStronglyConnected.isStr…Quiver.IsStronglyConnected.nonempty_path · cited by 0IsStronglyConnected.nonem…Quiver · cited by 405QuiverQuiver.Path · cited by 166Quiver.PathQuiver.IsStronglyConnectedCITED BYCITES

Cites2

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

Cited by5

Results whose statement or proof uses this declaration.