Caro–Wei-type lower bound for hard-core occupancy

Prove that for every finite graph G and fugacity λ>0, the expected size of a hard-core random independent set satisfies E|X| ≥ Σ_{v∈V(G)} λ/[1+(deg(v)+1)λ].

Background

The paper defines f_λ(d)=λ/[1+(d+1)λ] and notes that the previously established maximum-degree occupancy bound is sharp for disjoint unions of complete graphs. Conjecture A proposes a stronger degree-sensitive inequality, summing the corresponding local contributions over all vertices. Because f_λ is convex, the conjecture would also imply an average-degree version and strengthen the paper’s earlier occupancy and partition-function bounds, as well as the classical Caro–Wei theorem.