Id: palomar/PALOMAR-2026-11-19-000021 Url: https://github.com/jfairfaxball-348/Inverse-Greedy/tree/f4079bc46017e0b393f3678a0ab710eab1490116 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-19-000021-v1.json Repo: https://github.com/jfairfaxball-348/Inverse-Greedy Tags: math.CO, math.PR, msc:05C85, msc:60C05 Score: 0 Title: Inverse Greedy — five-vertex exponential-clock uniformity classification Trust: high Domain: math.CO Source: palomar Authors: John Fairfax-Ball Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-19 Formalized: true Formalizes: title=Inverse Greedy repository — five-vertex classification and real-clock law identifier=https://github.com/jfairfaxball-348/Inverse-Greedy/tree/c073675d83b29ae3c330efd504427f58ac2be066 relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-19-000021 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.