The Park-Pham theorem (previously known as the Kahn-Kalai conjecture) bounds the critical probability, $p_{c}(\mathcal{F})$ , of the a nontrivial property $\mathcal{F}\subseteq 2^{X}$ that is closed under supersets by the product of a universal constant K, the expectation threshold of the property, $q(\mathcal{F})$ , and the logarithm of the size of the property’s largest minimal element, $\log \ell (\mathcal{F})$ . That is, the Park-Pham theorem asserts that $p_{c}(\mathcal{F})\leq Kq(\mathcal{F})\log \ell (\mathcal{F})$ . Since the critical probability $p_{c}(\mathcal{F})$ always satisfies $p_{c}(\mathcal{F})<1$ , one may ask when the upper bound posed by Kahn and Kalai gives us more information than this–that is, when is it true that $Kq(\mathcal{F})\log \ell (\mathcal{F}) < 1$ ? In this short note, we provide a number of necessary conditions for this to happen and give a few sufficient conditions for the bounds to provide new (and, in fact, asymptotically perfect) information along the way. In the most interesting case where $\ell (\mathcal{F}_{n})\rightarrow \infty $ , we prove the following relatively strong necessary condition for the Kahn-Kalai bounds to provide nontrivial information: For every positive integer t, every collection of all-but-t of the minimal elements of $\mathcal{F}_{n}$ may have nonempty intersection for only finitely many n. Consequently, not only must the number of minimal elements become arbitrarily large, but so too must the size of any cover. Intuitively, this means that such sequences $\mathcal{F}_{n}$ must occupy an ever-widening ‘wedge’ in $2^{X_{n}}$ : the further $\mathcal{F}_{n}$ climbs up $2^{X_{n}}$ in one area, the further it must spread down and across $2^{X_{n}}$ in another.
