Integrality gap of the vertex cover linear programming relaxation

We give a characterization result for the integrality gap of the natural linear programming relaxation for the vertex cover problem. We show that integrality gap of the standard linear programming relaxation for any graph G equals 2−2χf(G) where χf(G) denotes the fractional chromatic number of G.