Theorems · Theorem · combinatorics

SimpleGraph.ConnectedComponent.Represents.exists_inter_eq_singleton

∀ {V : Type u} {G : SimpleGraph V} {C : Set G.ConnectedComponent} {s : Set V} {c : G.ConnectedComponent},
  SimpleGraph.ConnectedComponent.Represents s C → c ∈ C → ∃ x, s ∩ c.supp = {x}

Defined in

Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents

Cited by

2 results in Mathlib

Foundations

Depth 16 from the axioms · uses propext, Quot.sound