Open Research Index

The 50-color theorem for t-perfect graphs

Sang-il Oum

Palomar Registrypalomar/PALOMAR-2026-10-22-000004Oct 22, 2026math.COscore 0

A Lean proof that every finite t-perfect graph is 50-colorable. Here t-perfection means equality between the stable set polytope and the polytope described by coordinate, edge, and odd-cycle inequalities.

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