Id: palomar/PALOMAR-2026-08-23-000003 Url: https://github.com/novou/square-maximality-palomar/tree/b1d30cdb3334aa7bff7834b22b342393cdc97df8 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-08-23-000003-v1.json Repo: https://github.com/novou/square-maximality-palomar Tags: math.CO, msc:05C05, msc:05C30, msc:05C35, spanning-trees, graph-theory, lean-formalization Score: 0 Title: novou/square-maximality-palomar Trust: high Domain: math.CO Source: palomar Authors: Jiechen Zhang Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-08-23 Formalized: true Formalizes: title=Square Maximality for Spanning Trees of Induced Grid Subgraphs identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-08-23-000003 A Lean 4 formalization of square maximality for spanning trees of induced subgraphs of the square lattice. For every positive integer n and every finite set S of n^2 points in Z^2, the induced lattice graph on S has at most as many spanning trees as the n by n square, with equality exactly when S is a translate of that square. The development also proves the corresponding strict and equality statements for arbitrary spanning subgraphs, together with the finite Matrix--Tree theorem and the proof chain used by the paper.