homomorphisms · 2019. 12. 7. · proof. assume that we are given homomorphisms f z -+ y. the map ....
Post on 29-Aug-2020
0 Views
Preview:
TRANSCRIPT
Homomorphisms
Lemma The chromatic number of a graph X is the least integer r such that there is a homomorphism from X to Kr .
Core
Lemma 6.2.1 Let X and Y be cores. Then X and Yare homomorphically equivalent il and only il they are isomorphic.
Lemma 6.2.2 Every graph has a core, which is an induced subgraph and is unique up to isomorphism.
Lemma 6.2.3 Two graphs X and Y are homomorphically equivalent if and only if their cores are isomorphic.
Products
All Contents from C. Godsil and G. Royle, Algebraic Graph Theory
top related