The Setting
Let be a finite simple graph and let assign a positive weight to each vertex. The question is how a restriction on weighted adjacency between vertex sets constrains the total weight of triangles.
The vertex mass of a set is the sum of its vertex weights.✦ The cross mass of two sets is the sum of endpoint weight products over ordered adjacent pairs from to , as in (1); the sets may overlap. (1)
The unordered edge mass is the sum of endpoint weight products over unordered edges of , with the normalization in (2). (2)✦
The neighborhood of a vertex is the set of vertices adjacent to .✦ The common neighborhood mass of vertices is the total weight of their common neighbors, as in (3). (3)
The twice neighborhood triangle mass at is twice the sum of endpoint weight products over unordered edges contained in , given by (4). (4)✦
The unordered triangle mass is the sum of products of the three vertex weights over unordered triangles of , with the normalization in (5). (5)✦
For a real parameter , the growth function is the function defined in (6), where is the natural logarithm. (6)✦
A positive vertex weight on satisfies the cross-mass bound with constant if (7) holds for every real and every pair of sets with and . (7)✦
The Claim
Theorem 1. Let be real. There is a constant , depending only on , such that every finite simple graph with positive vertex weights satisfying the cross-mass bound with constant obeys (8). (8)✦
In the paper, the result reads: for every there is a constant such that every finite simple graph with positive vertex weights satisfying the cross-mass bound with constant has .
What Is Checked
The statement is over finite simple graphs with positive real vertex weights and the cross-mass bound of (7), using the edge mass of (2) and the triangle mass of (5).