On this page
Random-graph motif appearance planner
Family 176: The second Kahn–Kalai conjecture with an edge-count bound. First application triage, 9 October 2026 Australia/Brisbane.
Problem and potential new use
Simulation teams can compare expected subgraph-count thresholds with the stated appearance upper bound.
Applicability and commercial boundary
The unknown constant and worst subgraph expectation differ from a calibrated finite occurrence probability. It does not guarantee any single deployment contains a motif.
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 an exact small motif and inspect finite concentration estimates.
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.