For a set partition of the vertices of a graph of order , definewhere the sum is ordered, the adjacency indicator defines the density also on diagonal pairs, and exceptional vertices are treated as singleton parts. Refinement cannot decrease this energy, by the Cauchy-Schwarz inequality. An irregular pair of equal cells of size , with witnesses of relative size at least and density discrepancy greater than , increases the energy by more than for each orientation. Splitting refined atoms into equal chunks and leftover singleton parts is a further refinement, so restoring equitability causes no energy loss.
In a proof of the Szemerédi regularity lemma, suppose equal classes have size and witness splitting creates at most atoms per class. Divide every atom into blocks of size , putting leftovers into the exceptional set. At most vertices are lost. When , at most blocks remain. For equitable regularity energy defined by omitting exceptional vertices, the loss from discarding a fraction is at most : only ordered pairs incident with discarded vertices are removed, and every squared edge density of a bipartite graph is at most one. This provides a quantitative way to restore equal class sizes after each energy increment.
If a set partition refines a rectangle of a graph into rectangles , write for its edge density of a bipartite graph. The weighted variance identity isIt follows by expanding the square and using . In particular, equitable regularity energy cannot decrease under refinement. If a witness rectangle has relative sizes at least and edge density of a bipartite graph discrepancy greater than , its contribution, after division by the squared total vertex count, exceeds .
Articles by others on the same topic
There are currently no matching articles.