Almost all labeled graphs implies almost all graphs? I would be thankful if  someone could verify the following reasoning. 
Let $I$ be some graph property that is invariant (chromatic number, connectedness,etc.). Let $p(n)$ be the number of (labeled) graphs of degree $n$ that have property $I$. Suppose we know that almost all graphs have property $I$ that is to say
$$\lim_{n \to \infty} \frac{p(n)}{2^{ {n \choose 2}}} = 1. \; \; (1)$$
Does it imply that almost all non labeled graphs of $n$ have property $I$ as well?
My reasoning would say YES, since the number of all non labeled graphs is asympototic to $\frac{2^{n \choose 2}}{n!}$ and the size of the automorphism class of almost all graphs is $n!$ so if $p'(n)$ denotes the number of non labeled graphs we would have $p'(n) \sim p(n)$ and using a simmilar limit as in $(1)$ one derives at the conclusion that the given property also holds for almost all non labeled graphs.
Is the above true? If yes then this would be (in my opinion) quite nice since one can derive such results for labled graphs (which is in a way easier) and have the non labeled result "for free".
 A: In Bela Bollobas’ book “Random Graphs” (Cambridge University Press), a similar question is asked and answered in the affirmative, but only when the number of edges is fixed and not too close to $0$ or $n \choose 2$, the maximum.
Bollobas also states p.240-241 of this book that Walsh and Wright “carried out a detailed study of various spaces of unlabelled graphs (...) including the space of all unlabeled graphs of order $n$” which seems to be what the OP is asking for.
 Update (12/15/2012)  : As requested in a comment, here are more precise statements :
Theorem 9.4 (p.236 in Bollobas' book). Let  $M(n)$  be a function of $n$ such that
$$
(*) \frac{2M(n)}{n}-\log(n) \to +\infty, \ \ \  \frac{2(2^{n \choose 2}-M(n))}{n}-\log(n) \to +\infty
$$
Denote by ${\cal U}_{n,M(n)}$ the set of unlabeled graphs with $M(n)$ edges on $n$ vertices. Then
$$
|{\cal U}_{n,M(n)}| \sim \frac{2^{n \choose 2}}{n!}
$$
Theorem 9.5 (p.239 in Bollobas' book). Let $M(n)$ satisfy (*) as above. Let $Q$ be an isomorphism-invariant property of graphs. Denote by $l(Q,n)$ ($u(Q,n)$) the probability that a random (i.e, chosen with uniform probability in the finite set) labeled (unlabeled, respectively) graph with $n$ vertices and $M(n)$ edges has property $Q$. Then $l(Q,n) \sim u(Q,n)$. 
Exercise 9.3 (p.249 in Bollobas’ book) : show that ${\sf lim \ inf}(\frac{l(Q,n)}{u(Q,n)})>1$ for $M(n)=\frac{n}{2}(\log(n)+x_n)$ where $x_n$ tends to a constant, and $Q$ is the property of having at least two isolated vertices.
