Best monotone degree conditions for binding number

We give sufficient conditions on the vertex degrees of a graph  G to guarantee that  G has binding number at least  b , for any given b > 0 . Our conditions are best possible in exactly the same way that Chvátal’s well-known degree condition to guarantee a graph is Hamiltonian is best possible.