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.
Every nonregular -part partition has a refinement with energy gain greater than and at most parts
Statement
Let . If a partition of a nonempty graph is not -regular and has nonempty parts, then it has a refinement with at most parts and
Facts & Assumptions
Given: A non--regular -part partition .
Nonregularity means that the ordered irregular pairs have total weight (-regular vertex partitions, equitable partitions, and refinement).
Splitting an irregular pair by witness sets raises its contribution to energy by more than (An irregularity witness raises the pair energy by more than ).
Further refinement cannot reduce energy (Energy lies in and cannot decrease under refinement).
Proof
For each ordered irregular pair choose witness sets and .
For each , refine by all witness subsets that occur in , whether as a first or a second coordinate. There are at most such subsets, and the common refinement they generate has at most cells. By choosing one witness orientation for each unordered pair and retaining the two diagonal witnesses separately, the same construction uses at most subsets per part and hence at most cells. Thus the resulting partition has at most parts.
For every selected irregular ordered pair, the restriction of to its two old parts refines the witness split. By [L2] and [L3], its contribution gains more than ; all other old-pair contributions are nondecreasing.
Although only one orientation of each off-diagonal irregular pair supplied witness sets in step 2.1, that single split refines both old parts, so step 3.1 applies to both ordered pairs and , which carry equal weight and equal regularity status. Summing the gains over all ordered irregular pairs therefore recovers the full normalized irregular weight, and by [L1] the total gain is greater than .
Depends on
Used by
Dependency tree · two levels
6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Y. Zhao, Graph Theory and Additive Combinatorics, Lemma 2.1.14 (standard reference, not scraped)