Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.induce_verts
∀ {V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (s : Set V), (G'.induce s).verts = s- Cited by
- 15 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.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.vertsstatement and proof · cited by 210
- SimpleGraph.Subgraph.inducestatement and proof · cited by 33
Cited by15
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.induce_monoproof · cited by 4
- SimpleGraph.Subgraph.le_induce_unionproof · cited by 3
- SimpleGraph.Subgraph.induce_self_vertsproof · cited by 2
- SimpleGraph.Subgraph.subgraphOfAdj_eq_induceproof · cited by 2
- SimpleGraph.Subgraph.induce_union_connectedproof · cited by 1
- SimpleGraph.ConnectedComponent.odd_matches_node_outsideproof · cited by 1
- SimpleGraph.Subgraph.connected_induce_top_supproof · cited by 1
- SimpleGraph.connected_induce_unionproof · cited by 0
- SimpleGraph.Subgraph.induce_emptyproof · cited by 0
- SimpleGraph.ConnectedComponent.even_card_of_isPerfectMatchingproof · cited by 0
- SimpleGraph.Subgraph.singletonSubgraph_eq_induceproof · cited by 0
- SimpleGraph.Subgraph.deleteVerts_deleteVertsproof · cited by 0