How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
A prescribed finite vertex partition has a bounded -regular refinement, equitable when the initial partition is equitable
Statement
For every and there is such that every partition of a finite graph into at most nonempty parts has an -regular refinement into at most parts. If is equitable, may also be chosen equitable.
Facts & Assumptions
Given: , a finite graph, and a partition as in the Statement.
Every nonregular -part partition has a refinement with at most parts and energy gain greater than (Every nonregular -part partition has a refinement with energy gain greater than and at most parts).
Energy is nondecreasing under refinement and at most (Energy lies in and cannot decrease under refinement).
An equitable partition has part sizes differing by at most one; a partition is -regular when its irregular ordered pairs carry total weight at most ; and the empty family, the unique partition of the null graph, is equitable and -regular by convention (-regular vertex partitions, equitable partitions, and refinement).
, a sum over ordered pairs of parts with nonnegative weights and densities in (The mean-square density, or energy, of a vertex partition).
is -regular when every and with and satisfies (-regular pairs and self-regular vertex sets).
Proof
Arbitrary refinement. Starting from , apply [L1] whenever the current partition is not -regular; each application raises the energy by more than and replaces the part-count bound by . By [L2] the energy lies in , so at most applications occur, and iterating that map times from bounds the number of parts of the resulting -regular refinement of .
Constants for the equitable case. Put , , , and . Each factor is at least , so .
Small graphs. Assume is equitable and . The partition of into singletons refines , is equitable, and has parts. It is -regular: the only subset of a singleton with at least times its size is the singleton itself, so every pair of singletons has density difference in [L5]; for the convention in [L3] gives the same conclusion.
Equitisation. Let be equitable with parts, let refine with at most parts, put , and suppose . Order so that each part of is an interval and each cell of is an interval inside its part, and cut each part into consecutive pieces of sizes or . Writing and , the sizes force and , so every piece has size or and the result is an equitable refinement of with exactly parts.
Energy loss. Call a piece dirty when it is not contained in a single cell of , and let be the union of the dirty pieces. Each of the at most boundaries between consecutive -cells of one part lies in exactly one piece, so at most pieces are dirty, each of size at most ; hence . Let be the common refinement of and . It refines , so by [L2], while every clean piece is already a cell of , so by [L4] the two energies agree except on ordered pairs with an entry inside , which carry total weight at most and squared densities in . Therefore .
Iteration. Assume is equitable with parts and . Given an equitable that refines , has parts, and is not -regular, apply [L1] to get a refinement with at most parts and energy gain more than , then apply steps 2.2 and 3.1 with ; the hypothesis holds because makes . The result is equitable, refines and hence , has parts, and satisfies .
Since energy lies in by [L2], it cannot gain at successive rounds, so some with is -regular; it is equitable, refines , and has at most parts.
Let be the larger of and the bound supplied by step 1.1; both depend only on and . Step 1.1 proves the first assertion, and steps 2.1 and 5.1 prove the equitable assertion for and for respectively.
Depends on
- Every nonregular $k$-part partition has a refinement with energy gain greater than $\epsilon^5$ and at most $k2^{k+1}$ parts
- Energy lies in $[0,1]$ and cannot decrease under refinement
- $\epsilon$-regular vertex partitions, equitable partitions, and refinement
- The mean-square density, or energy, of a vertex partition
- $\epsilon$-regular pairs and self-regular vertex sets
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 13 results over 8 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Y. Zhao, Graph Theory and Additive Combinatorics, Theorem 2.1.19 and Theorem 2.1.20 (standard reference, not scraped)