[[concept]]
Let G=(V,E) and F=(V′,E′) be graphs. The homomorphism density from F to G, denoted t(F,G) is given as
Where hom(F,G) is the the total number of homomorphisms from F to G.
We can think of this as the probability of sampling a version of F from the graph G. ^def