Skip to main content
4 of 4
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/

Counting non-isomorphic graphs with prescribed number of edges and vertices

I'd love your help with this question.

Let $n\geq3$ be a fixed integer. How many non-isomorphic graphs with $p$ vertices and $q$ edges are there where $p+q=n$?

Thank you very much.

Crossposted at MSE.