Theorems · Definition · combinatorics
SimpleGraph.ComponentCompl
{V : Type u} → SimpleGraph V → Set V → Type uThe components outside a given set of vertices K
- Cited by
- 29 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- Compl.complproof · cited by 2,925
- SimpleGraph.ConnectedComponentproof · cited by 86
- SimpleGraph.induceproof · cited by 80
Cited by35
Results whose statement or proof uses this declaration.
- SimpleGraph.componentComplMkstatement · cited by 15
- SimpleGraph.ComponentCompl.homstatement and proof · cited by 12
- SimpleGraph.componentComplFunctorproof · cited by 6
- SimpleGraph.ComponentCompl.suppstatement and proof · cited by 6
- SimpleGraph.ComponentCompl.indstatement and proof · cited by 4
- SimpleGraph.ComponentCompl.disjoint_rightstatement and proof · cited by 3
- SimpleGraph.ComponentCompl.subset_homstatement and proof · cited by 3
- SimpleGraph.ComponentCompl.infinite_iff_in_all_rangesstatement and proof · cited by 2
- SimpleGraph.componentComplMk_memstatement · cited by 2
- SimpleGraph.ComponentCompl.nonemptystatement and proof · cited by 2
- SimpleGraph.ComponentCompl.supp_injectivestatement · cited by 2
- SimpleGraph.ComponentCompl.hom_eq_iff_lestatement and proof · cited by 1