![](/files/happy5.png)
density problems
Sidorenko's Conjecture โ โ โ
Author(s): Sidorenko
Conjecture For any bipartite graph
and graph
, the number of homomorphisms from
to
is at least
.
![$ H $](/files/tex/76c7b422c8e228780f70a4f31614cfcf3f831c65.png)
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ H $](/files/tex/76c7b422c8e228780f70a4f31614cfcf3f831c65.png)
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ \left(\frac{2|E(G)|}{|V(G)|^2}\right)^{|E(H)|}|V(G)|^{|V(H)|} $](/files/tex/a6c4d985a1ddfc6c35b74c9ae8e23d64f97d7781.png)
Keywords: density problems; extremal combinatorics; homomorphism
![Syndicate content Syndicate content](/misc/feed.png)
Author(s): Sidorenko
Keywords: density problems; extremal combinatorics; homomorphism