The above improves on results in [1]} for the Hard-core model by allowing a wider rage for \(\lambda \) .
The upper bound on \(\lambda \)  here is by a constant factor larger than the previous one. Particularly, for large
\({\rho }_G\)  this constant converges to \(e\) , i.e., the base of natural logarithms.
