The Setting
Let be a finite simple graph and let be a real vertex weight. The quantities at issue are the masses of edges and triangles when maximizes a graph potential.
The neighborhood of a vertex is the set of vertices adjacent to .✦ The vertex mass of a set is the sum of its vertex weights, as in (1). (1)✦ The common neighborhood mass of vertices is the mass of their common neighborhood, given by (2). (2)✦
The cross edge mass of vertex sets is the sum of endpoint weight products over ordered adjacent pairs from to , as in (3); the sets may overlap. (3)✦ The unordered edge mass of a vertex weight on is the sum of endpoint weight products over the edges of , with the normalization in (4). (4)✦
The twice neighborhood triangle mass at a vertex is twice the sum of endpoint weight products over edges within ; its expression in common neighborhood masses is (5). (5)✦ The unordered triangle mass of a vertex weight on is the sum of products of vertex weights over unordered triangles of , with the normalization in (6), where denotes the set of three-element cliques of . (6)✦
The Potential and Its Maximizers
The vertex potential is the function defined by (7), with natural logarithms and the convention . (7) The graph potential of a real vertex weight is the sum of its vertex potentials minus its unordered edge mass, as in (8). (8)✦ An optimizer of is a nonnegative vertex weight that is a global maximizer among all nonnegative vertex weights, as specified in (9). (9)✦
The Claim
Theorem 1. Let be an integer, let be a finite -free simple graph, and let be an optimizer of . The bound (10) holds for a real constant depending only on . (10)✦
In the paper, the result reads: every maximizer on a finite -free graph satisfies , where is the paper’s triangle-bound function and , and both masses are zero when the vertex set is empty.
What Is Checked
The claim is stated over nonnegative global maximizers of the potential (8) on finite -free simple graphs, for integers .