Matsoha, Moroli David Vusi
(University of Pretoria, 2016)
The Compactness Theorem for graph colourings, by De Bruijn
and Erd}os, can be restated as follows. If all the nite subgraphs of
a graph G are homomorphic to a nite complete graph Kn, then G
is also homomorphic to Kn. In ...