Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.HomClass

{V : Type u_1} → {W : Type u_2} → (F : Type u_5) → SimpleGraph V → SimpleGraph W → [FunLike F V W] → Prop

HomClass F G H asserts that F is a type of adjacency-preserving morphism.

Defined in
Mathlib.Combinatorics.SimpleGraph.Maps
Cited by
1 results in Mathlib
Foundations
Depth 4 from the axioms · uses no axioms
Assumes
FunLike
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsVertexCover.preimage · cited by 1IsVertexCover.preimageSimpleGraph · cited by 3072SimpleGraphFunLike · cited by 2560FunLikeSimpleGraph.Adj · cited by 1346SimpleGraph.AdjRelHomClass · cited by 13RelHomClassSimpleGraph.HomClassCITED BYCITES

Cites4

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.