Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.Copy.lineGraph

{V : Type u_1} →
  {V' : Type u_2} → {G : SimpleGraph V} → {G' : SimpleGraph V'} → G.Copy G' → G.lineGraph.Copy G'.lineGraph

Lift a copy between graphs to a copy between their line graphs

Defined in
Mathlib.Combinatorics.SimpleGraph.LineGraph
Cited by
1 results in Mathlib
Foundations
Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsContained.lineGraph · cited by 0IsContained.lineGraphSimpleGraph.Iso.lineGraph · cited by 0Iso.lineGraphSet.Elem · cited by 7166Set.ElemSimpleGraph · cited by 3072SimpleGraphSym2 · cited by 737Sym2SimpleGraph.edgeSet · cited by 199SimpleGraph.edgeSetSimpleGraph.Copy · cited by 49SimpleGraph.CopySimpleGraph.lineGraph · cited by 7SimpleGraph.lineGraphSimpleGraph.Embedding.toCopy · cited by 7Embedding.toCopySimpleGraph.Copy.toLineGraphEmbedding · cited by 2Copy.toLineGraphEmbeddingCopy.lineGraphCITED BYCITES

Cites8

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

Cited by2

Results whose statement or proof uses this declaration.