The second Kahn–Kalai conjecture
For every and every finite simple graph with edges and at most vertices, , and in particular .
The arithmetic (, ) and the application of Theorem 3.1 to Lemma 4.1 are exact and complete.
“Theorem 1.1. For every n ≥ 2 and every finite simple graph H with h = e(H) ≥ 1 edges and at most n vertices, pc(n, H) ≤ min{1, 2048e50pE(n, H)(1 + log2 h)}. (1.1) In particular, pc(n, H) ≤ 6144e50pE(n, H) log2 n.” · Show in paper