Sidorenko's conjecture
id:
sidorenko-s-conjecture-313-8637207
title:
Sidorenko's conjecture
text:
Sidorenko's conjecture is a conjecture in the field of graph theory, posed by Alexander Sidorenko in 1986. Roughly speaking, the conjecture states that for any bipartite graph H and graph G on n vertices with average degree p n , there are at least p | E | n | V | labeled copies of H in G , up to a small error term. Formally, it provides an intuitive inequality about graph homomorphism densities in graphons. The conjectured inequality can be interpreted as a statement that the density of copies
brand slug:
wiki
category slug:
encyclopedia
description:
Conjecture in graph theory
original url:
https://en.wikipedia.org/wiki/Sidorenko%27s_conjecture
date created:
date modified:
2023-12-02T23:48:58Z
main entity:
{"identifier":"Q85801084","url":"https://www.wikidata.org/entity/Q85801084"}
image:
fields total:
13
integrity:
14