# Random triangle-removal process reference

Family 188: The sharp terminal leave in random triangle removal. First application triage, 9 October 2026 Australia/Brisbane.

## Problem and potential new use

Graph-process researchers can compare terminal residual edges with the sharp n-to-three-halves constant.

## Applicability and commercial boundary

The uniform removal process starts from a complete graph; this is not a general optimal packing algorithm or residual bound on operational graphs.

## 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

Inspect finite-size convergence and compare a seeded process simulator.

## 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](source.json).

[The sharp terminal leave in random triangle removal](https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/The-Sharp-Terminal-Leave-in-Random-Triangle-Removal-September-25-2026/The-Sharp-Terminal-Leave-in-Random-Triangle-Removal-September-25-2026.pdf).