The CW-inequalities for vectors in \(\ell_ 1\) (Q1813623)

Let \(G=(V,E)\) be a graph, where \(V\) is a set of vectors in the metric space \(\ell_ 1\), the space consisting of vectors \((x_ 1,x_ 2,\dots)\) such that \(\sum^ \infty_{i=1}| x_ i|<\infty\) with a distance function defined by \(d({\mathbf x},{\mathbf y})=\sum^ \infty_{i=1}| x_ i-y_ i|\), where \({\mathbf x}=(x_ 1,x_ 2,\dots)\) and \({\mathbf y}=(y_ 1,y_ 2,\dots)\). Define a parameter \(d(G)=\sum_{uv\in E}d(u,v)\). For any integers \(k>0\) and \(u\geq 0\), and vectors \(v_ 0,v_ 1,\dots,v_{k+2u}\), \(u_ 0,u_ 1,\dots,u_{k- 1}\in\ell_ 1\) (not necessary distinct), writing \(X=\{v_ 0,\dots,v_{k+2u}\}\), \(Y=\{u_ 0,\dots,u_{k-1}\}\), construct the following graphs: \(W=(X,E_ 1)\): \(v_ iv_ j\in E_ 1\), if there is an \(s\), \(-u\leq s\leq u\) such that \(i-j\equiv s\) \((\text{mod }k+2u-1)\); \(B=(X\cup Y,E_ 2)\): a complete bipartite graph with bipartition \((X,Y)\); \(K_ X=(X,E_ 3)\): a complete graph; \(K_ Y=(Y,E_ 4)\): a complete graph. The author proves: \(d(W)+d(B)\geq d(K_ X)+d(K_ Y)\). This inequality is known as the Clique-Web inequality conjectured by M. Deza and M. Laurent in 1988.