Inequalities for functionals generated by bipartite graphs

DOI10.1515/dma.1992.2.5.489zbMath0787.05052OpenAlexW1977567472MaRDI QIDQ3980664

Alexander Sidorenko

Publication date: 26 June 1992

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1992.2.5.489

zbMATH Keywords

inequalities for functionals

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (17)

Finite reflection groups and graph norms ⋮ On tripartite common graphs ⋮ A partially ordered set of functionals corresponding to graphs ⋮ Multiplicities of subgraphs ⋮ Tree-Degenerate Graphs and Nested Dependent Random Choice ⋮ On some graph densities in locally dense graphs ⋮ The minimum number of triangles in graphs of given order and size ⋮ A Property on Monochromatic Copies of Graphs Containing a Triangle ⋮ Extended commonality of paths and cycles via Schur convexity ⋮ Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Inequalities for doubly nonnegative functions ⋮ Two approaches to Sidorenko’s conjecture ⋮ Convex graphon parameters and graph norms ⋮ Lower bounds for integral functionals generated by bipartite graphs ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ Extending the Hölder type inequality of Blakley and Roy to non-symmetric non-square matrices

This page was built for publication: Inequalities for functionals generated by bipartite graphs