The Setting
Let be a finite simple graph with vertex set and edge set . The question is how maximizing a graph potential restricts the weighted edges between two vertex sets.
For a real vertex weight , the vertex mass of a set is the sum in (1). (1)✦ The cross mass of vertex sets is the sum over ordered adjacent pairs in (2). (2) The unordered edge mass of a real vertex weight on is the sum of endpoint weight products over unordered edges of , as in (3). (3)✦
The vertex potential is the function in (4), with natural logarithms and the convention . (4)✦ The graph potential of a real vertex weight is the sum of its vertex potentials minus its unordered edge mass, as in (5). (5)✦ An optimizer for is a nonnegative vertex weight whose graph potential is at least that of every nonnegative vertex weight on .✦
For a real parameter , the growth function is defined by (6). (6)✦ For a real vertex weight on , a cross-mass bound with real constant is the estimate for every real and all vertex sets satisfying .
The Claim
Theorem 1. Let be a nonnegative integer, let be a finite simple -free graph, and let be an optimizer for . For every real and all vertex sets with , the cross-mass bound (7) holds. (7)✦
In the paper, the result reads: if is an integer and maximizes on a nonempty finite -free graph , then for every and vertex sets with , one has , where , and the sets may overlap.
What Is Checked
The statement is over finite simple -free graphs with nonnegative integral , weights maximizing the graph potential among all nonnegative weights, and arbitrary vertex sets.