Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Connected.of_subsingleton

∀ {V : Type u} {G : SimpleGraph V} [Nonempty V] [Subsingleton V], G.Connected
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Cited by
1 results in Mathlib
Foundations
Depth 7 from the axioms · uses no axioms
Assumes
NonemptySubsingleton
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsTree.of_subsingleton · cited by 1IsTree.of_subsingletonSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Connected · cited by 75SimpleGraph.ConnectedSimpleGraph.Preconnected.of_subsingleton · cited by 2Preconnected.of_subsingle…Connected.of_subsingletonCITED BYCITES

Cites3

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.