-
A graph H is said to be positive if its homomorphism density tH(W) is non-negative for every bounded symmetric measurable function W:2 → ℝ. Antolín Camarena, Csóka, Hubai, Lippner and Lovász conjectured that a graph is positive if and only if it can be obtained by gluing two copies of the same graph along an …

