OpenAI · 175-01 · 2026-10-05 · Combinatorics
Graph Decompositions at the Integral Expectation Threshold
preprints/Graph-Decompositions-at-the-Integral-Expectation-Threshold-October-5-2026
Family 175. Talagrand's conjectures and graph decompositions at expectation thresholds.
The authors are OpenAI. This companion does not verify the proof and does not adopt it as a theorem of Ngo Cheung’s series. It is not a premise. O.1 stays NOT_CLOSED. Anti-de Sitter results are not a de Sitter state, not Em02-E’s relational lapse, not XVI-P’s QdS scheme, and not XVI-Q’s sigma-image record. No quantum coefficient is admitted. No compilation is asserted.
Read against the standing problems
Standing problems. No standing problem is named in this text. It was still read against the nine problems and does not close any of them. The authors are OpenAI. The companion does not verify the proof. This is not a premise of a manuscript by Ngo Cheung. O.1 stays NOT_CLOSED. No quantum coefficient is admitted. No compilation is asserted. XVI-P · XVI-N
Proves that integral and fractional expectation thresholds differ by at most a universal factor, and resolves Talagrand's discrete-convexity conjecture. An application proves the Ascoli–He–Park–Talagrand graph-decomposition conjecture: every graph's edges split into a universally bounded number of fixed pieces, each with containment threshold at most a universal constant times the original graph's integral expectation threshold. The pieces' embeddings need not agree on shared vertices.
We prove the graph-decomposition conjecture of Ascoli, He, Park, and Talagrand. Every graph admits a partition into a universally bounded number of fixed edge pieces, each having ordinary containment threshold at most a universal constant times the original graph's integral expectation threshold. The partition is chosen before sampling the random host, and the separate embeddings of the pieces need not agree on shared vertices.
Preprint source and Lean scope
The abstract above is the catalogue abstract. The sections below are the full preprint source, 0 sections. This page is not only the abstract. The manuscript file is loading.
A Lean scope note is stored for family 175, but it does not name this preprint. It names 175-02, 175-03. This page still has the full preprint source. No compilation is asserted. O.1 stays NOT_CLOSED.