Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.componentComplMk_eq_of_adj

∀ {V : Type u} {K : Set V} (G : SimpleGraph V) {v w : V} (vK : v ∉ K) (wK : w ∉ K),
  G.Adj v w → G.componentComplMk vK = G.componentComplMk wK
Defined in
Mathlib.Combinatorics.SimpleGraph.Ends.Defs
Cited by
0 results in Mathlib
Foundations
Depth 15 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Set · cited by 53352SetSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.ComponentCompl · cited by 29SimpleGraph.ComponentComplSimpleGraph.Adj.reachable · cited by 17Adj.reachableSimpleGraph.componentComplMk · cited by 15SimpleGraph.componentComp…SimpleGraph.ConnectedComponent.eq · cited by 2ConnectedComponent.eqSimpleGraph.componentComplMk_…CITED BYCITES

Cites7

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

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.