# Counting graphs with fixed V+E

I'd love your help with this question.

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

Thank you very much.

-
Do you have any reason to think there will be any kind of useful formula for this? –  Gerry Myerson Jun 17 '11 at 0:55
This is very hard for fixed $p$ and $q$, and $n$ isn't a particularly natural parameter here. –  Qiaochu Yuan Jun 17 '11 at 0:56
For what it's worth, this is tabulated at oeis.org/A120412 –  Gerry Myerson Jun 17 '11 at 1:00
FWIW, this was also posted at mathoverflow.net/questions/68017/counting-graphs –  JavaMan Jun 17 '11 at 2:29
Might a starting point be to think about how many planar connected graphs there which obey this condition? –  Joseph Malkevitch Sep 1 '11 at 21:05