Theorems · Theorem · combinatorics
SimpleGraph.ConnectedComponent.connected_toSimpleGraph
∀ {V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent), C.toSimpleGraph.Connected- Cited by
- 6 results in Mathlib
- Foundations
- Depth 25 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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 and proof · cited by 86
- SimpleGraph.Connectedstatement · cited by 75
- SimpleGraph.ConnectedComponent.toSimpleGraphstatement and proof · cited by 14
- SimpleGraph.ConnectedComponent.reachable_toSimpleGraphproof · cited by 1
Cited by6
Results whose statement or proof uses this declaration.
- SimpleGraph.ConnectedComponent.connected_toSubgraphproof · cited by 2
- SimpleGraph.exists_isTutteViolatorproof · cited by 1
- SimpleGraph.ConnectedComponent.maximal_connected_induce_suppproof · cited by 1
- SimpleGraph.two_colorable_iff_forall_loop_evenproof · cited by 0
- SimpleGraph.ConnectedComponent.maximal_connected_induce_iffproof · cited by 0
- SimpleGraph.IsAcyclic.isTree_connectedComponentproof · cited by 0