Adjunctions, Box Products, and Forcing Families

Aldo Kiem, Olaf Parczyk, Christoph Spiegel

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite…