Homomorphism density
id:
homomorphism-density-323-1285712
title:
Homomorphism density
text:
In the mathematical field of extremal graph theory, homomorphism density with respect to a graph H is a parameter t that is associated to each graph G in the following manner: Above, hom is the set of graph homomorphisms, or adjacency preserving maps, from H to G . Density can also be interpreted as the probability that a map from the vertices of H to the vertices of G chosen uniformly at random is a graph homomorphism. There is a connection between homomorphism densities and subgraph densitie
brand slug:
wiki
category slug:
encyclopedia
description:
Concept in mathematical graph theory
original url:
https://en.wikipedia.org/wiki/Homomorphism_density
date created:
date modified:
2024-01-06T10:57:48Z
main entity:
{"identifier":"Q85767167","url":"https://www.wikidata.org/entity/Q85767167"}
image:
fields total:
13
integrity:
14