Theorems · Definition · combinatorics
SimpleGraph.Embedding.toCopy
{α : Type u_4} → {β : Type u_5} → {A : SimpleGraph α} → {B : SimpleGraph β} → A ↪g B → A.Copy BAn embedding gives rise to a copy.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Copy
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 14 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.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Copystatement · cited by 49
- SimpleGraph.Embeddingstatement and proof · cited by 41
- SimpleGraph.Embedding.toHomproof · cited by 17
- SimpleGraph.Hom.toCopyproof · cited by 0
Cited by11
Results whose statement or proof uses this declaration.
- SimpleGraph.Iso.toCopyproof · cited by 7
- SimpleGraph.Embedding.isContainedproof · cited by 4
- SimpleGraph.completeMultipartiteGraph.not_cliqueFree_of_le_cardproof · cited by 3
- SimpleGraph.isIndContained_iff_exists_iso_subgraphproof · cited by 2
- SimpleGraph.UnitDistEmbedding.embedproof · cited by 1
- SimpleGraph.Copy.induceproof · cited by 1
- SimpleGraph.Copy.lineGraphproof · cited by 1
- SimpleGraph.isContained_top_iffproof · cited by 0
- SimpleGraph.UnitDistEmbedding.embed_p_applystatement · cited by 0
- SimpleGraph.maxDegree_induce_of_support_subsetproof · cited by 0
- SimpleGraph.IsIndContained.lineGraphproof · cited by 0