Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.FinsubgraphHom.restrict

{V : Type u} →
  {W : Type v} →
    {G : SimpleGraph V} →
      {F : SimpleGraph W} →
        {G' G'' : G.Finsubgraph} → G'' ≤ G' → SimpleGraph.FinsubgraphHom G' F → SimpleGraph.FinsubgraphHom G'' F

Given a homomorphism from a subgraph to F, construct its restriction to a sub-subgraph.

Defined in
Mathlib.Combinatorics.SimpleGraph.Finsubgraph
Cited by
0 results in Mathlib
Foundations
Depth 64 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.finsubgraphHomFunctor · cited by 1SimpleGraph.finsubgraphHo…Set.Elem · cited by 7166Set.ElemSimpleGraph · cited by 3072SimpleGraphSet.Finite · cited by 1814Set.FiniteSimpleGraph.Subgraph · cited by 326SimpleGraph.SubgraphSimpleGraph.Subgraph.verts · cited by 210Subgraph.vertsSimpleGraph.Finsubgraph · cited by 15SimpleGraph.FinsubgraphRelHom.toFun · cited by 4RelHom.toFunSimpleGraph.FinsubgraphHom · cited by 0SimpleGraph.FinsubgraphHomFinsubgraphHom.restrictCITED BYCITES

Cites8

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.