A reverse Sidorenko inequality
Abstract Let H be a graph allowing loops as well as vertex and edge weights. We prove that, for every triangle-free graph G without isolated vertices, the weighted number of graph homomorphisms hom(G, H) satisfies the inequality hom(G, H) ≤ ∏[subscript uv∈E(G)] hom(K[subscript du,dv,]H)[superscri...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Science and Business Media LLC
2021
|
| Online Access: | https://hdl.handle.net/1721.1/129980 |