Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.ConnectedComponent.nonempty_supp

∀ {V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent), C.supp.Nonempty
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Cited by
2 results in Mathlib
Foundations
Depth 6 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsAcyclic.coloringTwo · cited by 1IsAcyclic.coloringTwoSimpleGraph.ncard_oddComponents_mono · cited by 1SimpleGraph.ncard_oddComp…SimpleGraph.two_colorable_iff_forall_loop_even · cited by 0SimpleGraph.two_colorable…SimpleGraph · cited by 3072SimpleGraphSet.Nonempty · cited by 2627Set.NonemptySimpleGraph.ConnectedComponent · cited by 86SimpleGraph.ConnectedComp…SimpleGraph.ConnectedComponent.supp · cited by 42ConnectedComponent.suppConnectedComponent.nonempty_s…CITED 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.