Abstract: In order to uncover the relations between the acyclic chromatic number and the maximum average degree of simple graph,by using discharging method and some properties of minimal graph,it was proved that for any simple graphs G with maximum average degree at least 7/2,if its maximum degree is no less than 6,then it’s acyclic chromatic number is no more than Δ(G)+2