A copositive formulation for the stability number of infinite graphs (Q344928)

According to \textit{D. de Laat} and the last author [Math. Program. 151, No. 2 (B), 529--553 (2015; Zbl 1328.90102)], a topological packing graph is a graph (with possibly infinitely many vertices and edges) whose vertex set \(V\) is a Hausdorff topological space and whose every finite clique is contained in an open clique. The main result of the paper provides a formulation of the stability number of such a graph, in the case when \(V\) is compact and metrizable, as a linear conic problem with two variables; one of them is real and the other one is a symmetric and continuous function \(K:V\times V\rightarrow \mathbb{R}\) which is copositive in the sense that \(\int_{V}\int_{V}K\left( x,y\right) f\left( x\right) f\left( y\right) d\omega \left( x\right) d\omega \left( y\right) \geq 0\) for all nonnegative continuous function \(f:V\rightarrow \mathbb{R};\) here \(\omega \) denotes a probability measure which is strictly positive on open sets. This optimization problem has an analogous structure as the copositive formulation of the stability number of a finite graph due to \textit{E. de Klerk} and \textit{D. V. Pasechnik} [SIAM J. Optim. 12, No. 4, 875--892 (2002; Zbl 1035.90058)], which is actually an immediate corollary of the main result in the paper under review.