Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.disjoint_incidenceSet

∀ {V : Type u} {G H : SimpleGraph V}, (∀ (v : V), Disjoint (G.incidenceSet v) (H.incidenceSet v)) ↔ Disjoint G H
Defined in
Mathlib.Combinatorics.SimpleGraph.Basic
Cited by
1 results in Mathlib
Foundations
Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.disjoint_incidenceFinset_of_disjoint · cited by 0SimpleGraph.disjoint_inci…Set · cited by 53352SetSimpleGraph · cited by 3072SimpleGraphDisjoint · cited by 2201DisjointSym2 · cited by 737Sym2SimpleGraph.incidenceSet · cited by 46SimpleGraph.incidenceSetSimpleGraph.disjoint_incidenc…CITED BYCITES

Cites5

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.