Theorems · Definition · combinatorics
SimpleGraph.Copy.toSubgraph
{α : Type u_4} → {β : Type u_5} → {A : SimpleGraph α} → {B : SimpleGraph β} → A.Copy B → B.SubgraphThe subgraph of B corresponding to a copy of A inside B.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Copy
- 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.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topproof · cited by 9,680
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Subgraphstatement · cited by 326
- SimpleGraph.Copystatement and proof · cited by 49
- SimpleGraph.Subgraph.mapproof · cited by 24
- SimpleGraph.Copy.toHomproof · cited by 14
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.Copy.isoToSubgraphstatement · cited by 3
- SimpleGraph.Copy.range_toSubgraphstatement and proof · cited by 2
- SimpleGraph.isIndContained_iff_exists_iso_subgraphproof · cited by 2
- SimpleGraph.copyCount_eq_card_image_copyToSubgraphstatement and proof · cited by 1
- SimpleGraph.Copy.toSubgraph_surjOnstatement · cited by 0