Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Connected.mono

∀ {V : Type u} {G G' : SimpleGraph V}, G ≤ G' → G.Connected → G'.Connected
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Cited by
3 results in Mathlib
Foundations
Depth 12 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Subgraph.Connected.mono · cited by 4Connected.monoSimpleGraph.Connected.exists_connected_induce_compl_singleton_of_finite_nontrivial · cited by 1Connected.exists_connecte…SimpleGraph.cycleGraph_connected · cited by 0SimpleGraph.cycleGraph_co…SimpleGraph · cited by 3072SimpleGraphSimpleGraph.Connected · cited by 75SimpleGraph.ConnectedSimpleGraph.Connected.preconnected · cited by 28Connected.preconnectedSimpleGraph.Preconnected.mono · cited by 2Preconnected.monoConnected.monoCITED BYCITES

Cites4

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.