Combinatorics · Oct 6, 2026
The second Kahn–Kalai conjecture with an edge-count bound
Proves the second Kahn–Kalai conjecture: for every finite simple graph H with h ≥ 1 edges and at most n vertices, its appearance threshold in is at most , with universal C. Here is the least density at which every subgraph of H has expected copy count at least 1/2.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model