Density via duality
We present an unexpected correspondence between homomorphism duality theorems and gaps in the poset of graphs and their homomorphisms. This gives a new proof of the density theorem for undirected graphs and solves the density problem for directed graphs. (C) 2002 Elsevier Science B.V. All rights reserved.
density duality homomorphisms graphs