# How many pairwise non-isomorphic simple graphs are there of 60 points and 1768 edges

How many pairwise non-isomorphic simple graphs are there of 60 points and 1768 edges?

I'm having some trouble trying to figure this one out. Is there a general solution to solve this? Previous posts said to draw graphs, but I feel that it's pretty difficult to do realistically given the number of points and edges.

Hint: The complete graph on $60$ vertices has $${60\choose 2}=1770$$ edges. How many ways can you remove 2 edges and be left with non-isomorphic graphs?