Non-trivial squares and Sidorenko's conjecture

Pranav Garg, Annie Raymond, Amanda Redlich

Let $t(H;G)$ be the homomorphism density of a graph $H$ into a graph $G$. Sidorenko's conjecture states that for any bipartite graph $H$, $t(H;G)\ge t(K_2;G{)}^{|E(H)|}$ for all gra…