On this page
Graph coloring bound assumption auditor
Family 157: Graph coloring, clique minors, and Colin de Verdière invariants. First application triage, 9 October 2026 Australia/Brisbane.
Problem and potential new use
Allocation-model researchers can flag reliance on clique-minor or Colin-de-Verdière fractional bounds that the source disproves.
Applicability and commercial boundary
The surviving list-coloring bound has an unspecified universal constant, and minority graph invariants may be expensive to compute. It is not a general practical coloring improvement.
Initial business decision
Research or conditional engineering only until an effective implementation and a recurring buyer problem are identified. No commercial demand or profitability is established. Where a direct product bridge is weak, the legitimate use is a research reference or evidence adapter, rather than a new standalone company.
Next verification action
Extract a finite counterexample and identify which existing modeling assertion it actually challenges.
Evidence scope
The catalog statement was individually reviewed. The manuscript proof and selected formal statement have not yet been compared in depth for this family. No independent proof verification was run. Pinned source revision fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb. See source metadata.