Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.Connected.induce_verts
∀ {V : Type u} {G : SimpleGraph V} {H : G.Subgraph}, H.Connected → (SimpleGraph.induce H.verts G).Connected- Cited by
- 1 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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.inducestatement · cited by 80
- SimpleGraph.Connectedstatement · cited by 75
- SimpleGraph.Subgraph.Connectedstatement and proof · cited by 24
- SimpleGraph.connected_induce_iffproof · cited by 4
- SimpleGraph.Subgraph.Connected.monoproof · cited by 4
- SimpleGraph.Subgraph.le_induce_top_vertsproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.connected_induce_supportproof · cited by 1