Why would it be impossible to draw an undirected graph G that has 12 vertices, with 3 connected components if G had 66 edges?
Undirected graph G that has 12 vertices, 66 edges and 3 connected components?
graph theory;combinatorics