Lower bounds for integral functionals generated by bipartite graphs
Date of Original Version
We study lower estimates for integral fuctionals for which the structure of the integrand is defined by a graph, in particular, by a bipartite graph. Functionals of such kind appear in statistical mechanics and quantum chemistry in the context of Mayer’s transformation and Mayer’s cluster integrals. Integral functionals generated by graphs play an important role in the theory of graph limits. Specific kind of functionals generated by bipartite graphs are at the center of the famous and much studied Sidorenko’s conjecture, where a certain lower bound is conjectured to hold for every bipartite graph. In the present paper we work with functionals more general and lower bounds significantly sharper than those in Sidorenko’s conjecture. In his 1991 seminal paper, Sidorenko proved such sharper bounds for several classes of bipartite graphs. To obtain his result he used a certain way of “gluing” graphs. We prove his inequality for a new class of bipartite graphs by defining a different type of gluing.
Publication Title, e.g., Journal
Czechoslovak Mathematical Journal
Kaskosz, Barbara, and Lubos Thoma. "Lower bounds for integral functionals generated by bipartite graphs." Czechoslovak Mathematical Journal 69, 2 (2019): 571-592. doi: 10.21136/CMJ.2019.0453-17.