Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.induce_self_verts
∀ {V : Type u} {G : SimpleGraph V} {G' : G.Subgraph}, G'.induce G'.verts = G'- Cited by
- 2 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.
Cites11
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
- Set.extproof · cited by 2,266
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.vertsstatement and proof · cited by 210
- SimpleGraph.Subgraph.Adjproof · cited by 147
- SimpleGraph.Subgraph.inducestatement · cited by 33
- SimpleGraph.Subgraph.extproof · cited by 33
- SimpleGraph.Subgraph.induce_adjproof · cited by 17
- SimpleGraph.Subgraph.edge_vertproof · cited by 17
- SimpleGraph.Subgraph.induce_vertsproof · cited by 15
- SimpleGraph.Subgraph.Adj.symmproof · cited by 14
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.le_induce_top_vertsproof · cited by 4
- SimpleGraph.Subgraph.deleteVerts_emptyproof · cited by 1