How Complex are Random Graphs in First Order Logic?

Jeong Han Kim, Oleg Pikhurko, Joel Spencer +1

It is not hard to write a first order formula which is true for a given graph G but is false for any graph not isomorphic to G. The smallest number $(G) of nested quantifiers in a…