Inequalities for functionals generated by bipartite graphs
From MaRDI portal
Cited in
(24)- A partially ordered set of functionals corresponding to graphs
- The minimum number of triangles in graphs of given order and size
- Multiplicities of subgraphs
- Convex graphon parameters and graph norms
- Inequalities for doubly nonnegative functions
- Finite reflection groups and graph norms
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- Two approaches to Sidorenko's conjecture
- Extending the Hölder type inequality of Blakley and Roy to non-symmetric non-square matrices
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 4216032 (Why is no real title available?)
- scientific article; zbMATH DE number 4139789 (Why is no real title available?)
- Supersaturation of even linear cycles in linear hypergraphs
- Lower bounds for integral functionals generated by bipartite graphs.
- On tripartite common graphs
- Tree-Degenerate Graphs and Nested Dependent Random Choice
- On some graph densities in locally dense graphs
- A Property on Monochromatic Copies of Graphs Containing a Triangle
- Extended commonality of paths and cycles via Schur convexity
- Domination inequalities and dominating graphs
- Sidorenko hypergraphs and random Turán numbers
- A sharp lower bound for the number of mappings of a linear graph into an arbitrary graph and an inequality of A. F. Sidorenko
- Rational exponents for cliques
- Ramsey multiplicity of apices of trees
This page was built for publication: Inequalities for functionals generated by bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3980664)
