A correlation inequality for bipartite graphs (Q2366960)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A correlation inequality for bipartite graphs |
scientific article |
Statements
A correlation inequality for bipartite graphs (English)
0 references
11 August 1993
0 references
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].
0 references
bipartite graph
0 references
conjecture
0 references
Lebesgue measure
0 references