Theorems · Definition · combinatorics
SimpleGraph.ComponentCompl.supp
{V : Type u} → {G : SimpleGraph V} → {K : Set V} → G.ComponentCompl K → Set VThe set of vertices of G making up the connected component C
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 14 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
- Set.ofPredproof · cited by 6,101
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.ComponentComplstatement and proof · cited by 29
- SimpleGraph.componentComplMkproof · cited by 15
Cited by6
Results whose statement or proof uses this declaration.
- SimpleGraph.ComponentCompl.infinite_iff_in_all_rangesstatement and proof · cited by 2
- SimpleGraph.ComponentCompl.supp_injectivestatement and proof · cited by 2
- SimpleGraph.infinite_iff_in_eventualRangestatement · cited by 0
- SimpleGraph.end_componentCompl_infinitestatement · cited by 0
- SimpleGraph.ComponentCompl.supp_injstatement · cited by 0
- SimpleGraph.ComponentCompl.supp_injective_iffstatement and proof · cited by 0