Sidorenko's conjecture, colorings and independent sets
Let hom(H, G) denote the number of homomorphisms from a graph H to a graph G. Sidorenko's conjecture asserts that for any bipartite graph H, and a graph G we have hom(H, G) > v(G)[superscript v(H)](hom(K[subscript 2], G)[superscript e(H)]/v(G)[superscript 2], where v(H), v(G) and e(H), e(G)...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
European Mathematical Information Service (EMIS),
2017-06-21T18:31:37Z.
|
| Subjects: | |
| Online Access: | Get fulltext |