Theorems · Definition · combinatorics
SimpleGraph.connectedComponentMk
{V : Type u} → (G : SimpleGraph V) → V → G.ConnectedComponentGives the connected component containing a particular vertex.
- Cited by
- 40 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Reachableproof · cited by 141
- SimpleGraph.ConnectedComponentstatement · cited by 86
Cited by48
Results whose statement or proof uses this declaration.
- SimpleGraph.ConnectedComponent.suppproof · cited by 42
- SimpleGraph.componentComplMkproof · cited by 15
- SimpleGraph.ConnectedComponent.mapproof · cited by 11
- SimpleGraph.ConnectedComponent.Representsproof · cited by 10
- SimpleGraph.ConnectedComponent.soundstatement · cited by 9
- SimpleGraph.ConnectedComponent.indstatement and proof · cited by 7
- SimpleGraph.ConnectedComponent.mem_supp_iffstatement · cited by 4
- SimpleGraph.ComponentCompl.indproof · cited by 4
- SimpleGraph.ConnectedComponent.ind₂statement and proof · cited by 3
- SimpleGraph.homOfConnectedComponentsproof · cited by 2
- SimpleGraph.ConnectedComponent.connectedComponentMk_eq_of_adjstatement · cited by 2
- SimpleGraph.ConnectedComponent.eqstatement · cited by 2