Lower bounds for integral functionals generated by bipartite graphs.

DOI10.21136/CMJ.2019.0453-17MaRDI QIDQ5227124zbMATH OpenOpenAlexWikidataFDO

Authors Luboš Thoma, Barbara Kaśkosz

Publication date 5 August 2019

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21136/cmj.2019.0453-17

zbMATH Keywords

bipartite graphgraph homomorphismintegral inequalitySidorenko's conjecture

Mathematics Subject Classification ID

Applications of graph theory (05C90) Extremal problems in graph theory (05C35) Inequalities for sums, series and integrals (26D15)

Recommendations

• Two approaches to Sidorenko's conjecture
• A correlation inequality for bipartite graphs
• Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
• Sidorenko's conjecture for blow-ups
• Publication:3469120

Cites work

• scientific article; zbMATH DE number 46153 (Why is no real title available?)
• A correlation inequality for bipartite graphs
• An approximate version of Sidorenko's conjecture
• Finite reflection groups and graph norms
• Graph norms and Sidorenko's conjecture
• Graph weights arising from Mayer's theory of cluster integrals
• Inequalities for functionals generated by bipartite graphs
• Large networks and graph limits
• Mayer and Ree-Hoover weights, graph invariants and bipartite complete graphs
• Measure theory. Vol. I and II
• Solution to a combinatorial puzzle arising from Mayer's theory of cluster integrals
• Some advances on Sidorenko's conjecture
• The step Sidorenko property and non-norming edge-transitive graphs
• Two approaches to Sidorenko's conjecture

Cited in

(1)

• scientific article; zbMATH DE number 4216032 (Why is no real title available?)

This page was built for publication: Lower bounds for integral functionals generated by bipartite graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227124)