Common graph
id:
common-graph-317-15084022
title:
Common graph
text:
In graph theory, an area of mathematics, common graphs belong to a branch of extremal graph theory concerning inequalities in homomorphism densities. Roughly speaking, F is a common graph if it "commonly" appears as a subgraph, in a sense that the total number of copies of F in any graph G and its complement G ¯ is a large fraction of all possible copies of F on the same vertices. Intuitively, if G contains few copies of F , then its complement G ¯ must contain lots of copies of F in order to co
brand slug:
wiki
category slug:
encyclopedia
description:
Concept in extremal graph theory
original url:
https://en.wikipedia.org/wiki/Common_graph
date created:
date modified:
2024-01-06T01:42:18Z
main entity:
{"identifier":"Q112132167","url":"https://www.wikidata.org/entity/Q112132167"}
image:
fields total:
13
integrity:
14