<?xml version="1.0"?>
<dblp>
<article key="journals/rsa/KimPSV05" mdate="2005-06-03">
<author>Jeong Han Kim</author>
<author>Oleg Pikhurko</author>
<author>Joel H. Spencer</author>
<author>Oleg Verbitsky</author>
<title>How complex are random graphs in first order logic?</title>
<pages>119-145</pages>
<year>2005</year>
<volume>26</volume>
<journal>Random Struct. Algorithms</journal>
<number>1-2</number>
<ee>http://dx.doi.org/10.1002/rsa.20049</ee>
<url>db/journals/rsa/rsa26.html#KimPSV05</url>
</article>
</dblp>
