Delphi.science

Inverse Greedy — five-vertex exponential-clock uniformity classification

Source: github.com/jfairfaxball-348/Inverse-Greedy/tree/f4079bc4601…

John Fairfax-Ball

Palomar Registrypalomar/PALOMAR-2026-11-19-000021Nov 19, 2026math.COscore 0

Formal classification of positive-rate independent exponential-clock random greedy maximal-independent-set uniformity for all finite simple graphs on at most five vertices: exactly the five-vertex path is excluded, up to graph isomorphism.

RepositoryJSONText

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