Theorems · Definition · combinatorics
SimpleGraph.Subgraph.restrict
{V : Type u} → {G : SimpleGraph V} → {G' : G.Subgraph} → G.Subgraph → G'.coe.SubgraphGiven a subgraph of G, restrict it to being a subgraph of another subgraph G' by
taking the portion of G that intersects G'.
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 12 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.Subgraph.homproof · cited by 18
- SimpleGraph.Subgraph.comapproof · cited by 5
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.restrict_adjstatement · cited by 1
- SimpleGraph.Subgraph.restrict_coeSubgraphstatement · cited by 1
- SimpleGraph.Subgraph.coeSubgraph_restrict_eqstatement and proof · cited by 0