申論題

4. Let G=(V,E) and H=(V,F) be simple undirected graphs, where V is the vertex set, and E and F are the edge sets. The union of E and F forms the edge set of the complete graph on V. Prove or disprove the following statement: One of G or H must be connected. (15%)