This is Graph Theory

7. Let G be a triangle-free graph on 100 vertices. (A graph is triangle-free if it contains no triangles.) Suppose that for every subset X of V (G), the number of odd components of G-X is at most X. (Here G-X denotes the graph obtained from G by deleting all the vertices in X.) Determine the chromatic number of G, the complement of G