Counting lemma
id:
counting-lemma-315-8557000
title:
Counting lemma
text:
The counting lemmas this article discusses are statements in combinatorics and graph theory. The first one extracts information from ϵ -regular pairs of subsets of vertices in a graph G , in order to guarantee patterns in the entire graph; more explicitly, these patterns correspond to the count of copies of a certain graph H in G . The second counting lemma provides a similar yet more general notion on the space of graphons, in which a scalar of the cut distance between two graphs is correlated
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Counting_lemma
date created:
date modified:
2023-02-10T03:29:28Z
main entity:
{"identifier":"Q111950818","url":"https://www.wikidata.org/entity/Q111950818"}
image:
fields total:
13
integrity:
13