A correlation inequality for bipartite graphs
From MaRDI portal
Publication:2366960
Let \((V,E)\) be a bipartite graph with vertex partites \(U,W\). When we write \((i,j) \in E\) we imply that \(i \in U\) and \(j \in W\). This paper is devoted to a discussion of the following conjecture and its generalizations. Conjecture 1. For any bipartite graph \((V,E)\) and any bounded, nonnegative, measurable function \(h\) on \([0,1]^ 2\), \[ \int \prod_{(i,j) \in E}h(x_ i,y_ i)d \mu^{| V |} \geq \bigl( \int hd\mu^ 2\bigr)^{| E |} \] where \(\mu\) denotes the Lebesgue measure on [0,1].
Recommendations
Cites work
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- A MATRIX INEQUALITY
- An Inequality Arising in Genetical Theory
- scientific article; zbMATH DE number 3885945 (Why is no real title available?)
- scientific article; zbMATH DE number 3145158 (Why is no real title available?)
- scientific article; zbMATH DE number 4216032 (Why is no real title available?)
- scientific article; zbMATH DE number 125748 (Why is no real title available?)
- scientific article; zbMATH DE number 797403 (Why is no real title available?)
- scientific article; zbMATH DE number 3345452 (Why is no real title available?)
- Two inequalities in nonnegative symmetric matrices
Cited in
(only showing first 100 items - show all)- The step Sidorenko property and non-norming edge-transitive graphs
- On the local approach to Sidorenko's conjecture
- Multiplicities of subgraphs
- Bilinear and quadratic variants on the Littlewood-Offord problem
- An elementary analog of the operator method in additive combinatorics
- On Hamiltonian cycles in hypergraphs with dense link graphs
- Convex graphon parameters and graph norms
- Threshold Ramsey multiplicity for paths and even cycles
- Spectrum of heavy-tailed elliptic random matrices
- Geometric and o-minimal Littlewood-Offord problems
- Cut distance identifying graphon parameters over weak* limits
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- Concatenating bipartite graphs
- Non-bipartite \(k\)-common graphs
- A path forward: tropicalization in extremal combinatorics
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- Simple graph density inequalities with no sum of squares proofs
- Inequalities for doubly nonnegative functions
- Fourier uniformity of bounded multiplicative functions in short intervals on average
- Differential calculus on graphon space
- Finite reflection groups and graph norms
- Extremal results in sparse pseudorandom graphs
- Impartial digraphs
- A combinatorial proof of the Burdzy-Pitman conjecture
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Two approaches to Sidorenko's conjecture
- Extending the Hölder type inequality of Blakley and Roy to non-symmetric non-square matrices
- Non-three-colourable common graphs exist
- Multiple recurrence for two commuting transformations
- Dependent random choice
- On replica symmetry of large deviations in random graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Sidorenko's conjecture for blow-ups
- Bipartite density and the independence ratio
- Color the cycles
- Counting odd cycles in locally dense graphs
- Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
- Graph homomorphisms between trees
- Decompositions into subgraphs of small diameter
- Supersaturation of even linear cycles in linear hypergraphs
- Threshold Ramsey multiplicity for odd cycles
- Supersaturation problem for color-critical graphs
- Sidorenko's conjecture, colorings and independent sets
- The exact minimum number of triangles in graphs with given order and size
- Popular progression differences in vector spaces II
- Lower bounds for integral functionals generated by bipartite graphs.
- On the lower tail variational problem for random graphs
- Anti-Ramsey Multiplicities
- Invertibility of symmetric random matrices
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- On a conjecture of Nagy on extremal densities
- Counting configuration-free sets in groups
- Graph norms and Sidorenko's conjecture
- On the density of a graph and its blowup
- Counting colorings of triangle-free graphs
- Locally common graphs
- Tree-Degenerate Graphs and Nested Dependent Random Choice
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- On some graph densities in locally dense graphs
- On Sidorenko's conjecture for determinants and Gaussian Markov random fields
- New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023
- Toward characterizing locally common graphs
- Balanced supersaturation for some degenerate hypergraphs
- Extremal results on feedback arc sets in digraphs
- Undecidability of polynomial inequalities in weighted graph homomorphism densities
- A Property on Monochromatic Copies of Graphs Containing a Triangle
- An approximate version of Sidorenko's conjecture
- Common graphs with arbitrary connectivity and chromatic number
- Paths of given length in tournaments
- Extended commonality of paths and cycles via Schur convexity
- On a common-extendable, non-Sidorenko linear system
- Off-diagonal commonality of graphs via entropy
- More non-bipartite forcing pairs
- Domination inequalities and dominating graphs
- Interview with David Conlon
- On uncommon systems of equations
- Ubiquity of power sums in graph profiles
- Sidorenko hypergraphs and random Turán numbers
- A new family of Sidorenko linear configurations
- Maximising the number of properly 2-coloured 4-cycles
- Non-trivial squares and Sidorenko's conjecture
- Common pairs of graphs
- New Ramsey multiplicity bounds and search heuristics
- On the uncommonness of minimal rank-2 systems of linear equations
- Local aspects of the Sidorenko property for linear equations
- Undecidability of polynomial inequalities in tournaments
- On monochromatic solutions of linear equations using at least three colors
- A note on directed analogues of the Sidorenko and forcing conjectures
- A sharp lower bound for the number of mappings of a linear graph into an arbitrary graph and an inequality of A. F. Sidorenko
- Moderate deviations of triangle counts in the Erdős-Rényi random graph G (n, m): the lower tail
- Common graphs with arbitrary chromatic number
- Rational exponents for cliques
- Supersaturation beyond color-critical graphs
- Disconnected common graphs via supersaturation
- On counting (quantum-)graph homomorphisms in finite fields of prime order
- The four-color Ramsey multiplicity of triangles
- Ramsey multiplicity of apices of trees
- Supersaturation of odd linear cycles
- A reverse Sidorenko inequality
- Weak hypergraph regularity and linear hypergraphs
This page was built for publication: A correlation inequality for bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366960)
