Prove Graph G is in Vizing Class 2 if $\alpha$'(G) < |e(G)|/$\Delta$(G) G is a simple graph with e edges, maximum vertex degree $\Delta$ and edge independence number $\alpha$' which satisfies $\alpha$' < e/$\Delta$.
What does this inequality mean? How is it helpful in proving that G is Vizing Class 2?
I'm struggling to understand what property of G this inequality implies. This inequality obviously works for graphs known to be in Vizing Class 2, like odd cycle graphs, but I'm not sure if I should be reasoning backwards like that.

I discovered the answer was simpler than I thought.
$\alpha$' < e/$\Delta$ --> $\Delta$ < e/$\alpha$'
$\chi$' >= e/$\alpha$'
$\chi$' > $\Delta$
