Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.Copy.induce

{V : Type u_1} → (G : SimpleGraph V) → (s : Set V) → (SimpleGraph.induce s G).Copy G

The copy from an induced subgraph to the initial simple graph.

Defined in
Mathlib.Combinatorics.SimpleGraph.Copy
Cited by
1 results in Mathlib
Foundations
Depth 16 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.card_edgeFinset_deleteIncidenceSet_le_extremalNumber · cited by 1SimpleGraph.card_edgeFins…Set · cited by 53352SetSet.Elem · cited by 7166Set.ElemSimpleGraph · cited by 3072SimpleGraphSimpleGraph.induce · cited by 80SimpleGraph.induceSimpleGraph.Copy · cited by 49SimpleGraph.CopySimpleGraph.Embedding.toCopy · cited by 7Embedding.toCopySimpleGraph.Embedding.induce · cited by 6Embedding.induceCopy.induceCITED BYCITES

Cites7

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.