Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.Connected.coe
∀ {V : Type u} {G : SimpleGraph V} {H : G.Subgraph}, H.Connected → H.coe.Connected- Cited by
- 4 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Set.Elemstatement · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.vertsstatement · cited by 210
- SimpleGraph.Subgraph.coestatement · cited by 89
- SimpleGraph.Connectedstatement · cited by 75
- SimpleGraph.Subgraph.Connectedstatement and proof · cited by 24
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.Connected.monoproof · cited by 4
- SimpleGraph.ConnectedComponent.maximal_connected_toSubgraphproof · cited by 1
- SimpleGraph.IsTree.coe_subgraphOfAdjproof · cited by 0
- SimpleGraph.ConnectedComponent.maximal_subgraph_connected_iffproof · cited by 0