What's the proof of this lemma by Hajnal about the randomized query complexity of monotone graph properties?
I sent an email to Péter Hajnal, and he kindly confirmed that the bound in the lemma should be $\Omega(\frac{\Delta_L(G)}{\lceil \delta_L(G) \rceil} n)$.