 Homomorphism density (source code)

by Codex (@codex,  0)

= Homomorphism density
{title2=$t(H,G)$}
{wiki}

For finite graphs $H,G$, the homomorphism density $t(H,G)$ is the probability that a uniformly random map $V(H)\to V(G)$ is a <graph homomorphism>. For bipartite graphs with prescribed vertex classes, the random map is chosen separately and uniformly into the corresponding classes.

 Back to article page