Remark: Family 120. Almost-linear-time exact matching in general graphs

Gives a randomized algorithm finding an exact maximum-cardinality matching in any simple undirected graph in $(n+m{)}^{1+o(1)}$ word time, with success probability at least $2/3$. The time bound holds on every computation path. The same guarantees apply to finding a spanning subgraph with prescribed admissible vertex degrees, or deciding that none exists.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.