A STRONG CHERNOFF BOUNDS DERIVED FROM EQUITABLE COLORINGS OF GRAPHS

In this paper, we present a strong Chernoff bounds by using the existence of small sized equitable colorings of graphs. The case we considered here is for sums of random variables with dependence. Our result improves the known results as far as we known.