Theorems · Theorem · combinatorics
SimpleGraph.Embedding.isContained
∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (f : G ↪g H), G.IsContained H- Defined in
- Mathlib.Combinatorics.SimpleGraph.Copy
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 15 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.IsContainedstatement · cited by 68
- SimpleGraph.Embeddingstatement and proof · cited by 41
- SimpleGraph.Embedding.toCopyproof · cited by 7
- SimpleGraph.Copy.isContainedproof · cited by 2
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.not_cliqueFree_iff_top_isContainedproof · cited by 7
- SimpleGraph.CliqueFree.replaceVertexproof · cited by 3
- SimpleGraph.completeMultipartiteGraph.not_cliqueFree_of_infiniteproof · cited by 2
- SimpleGraph.IsIndContained.isContainedproof · cited by 1