novou/square-maximality-palomar
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-08-23-000003
curl -X POST /api/v1/records/palomar/PALOMAR-2026-08-23-000003/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-08-23-000003/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'