Open Research Index

sneed-and-feed/lean-theorems-1

Sneed & Feed Formalization Team

Palomar Registrypalomar/PALOMAR-2026-08-26-000001Aug 26, 2026math.COscore 0

A complete, machine-checked Lean 4 formalization of the Graham–Pollak theorem (1971) and its tightness on complete bipartite partitions of complete graphs. Proves that any partition of the edges of the complete graph K_n into m complete bipartite subgraphs requires at least n - 1 bipartite graphs (m >= n - 1), adapting Helge Tverberg's 1982 linear-algebraic quadratic form argument. Also formalizes the canonical star partition proving tightness. To the maintainers' knowledge, Graham–Pollak was not previously formalized in Mathlib (checked against Mathlib v4.34.0-rc1).

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-08-26-000001
curl -X POST /api/v1/records/palomar/PALOMAR-2026-08-26-000001/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-26-000001/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'