First Order Definability of Trees and Sparse Random Graphs

Tom Bohman, Alan Frieze, Tomasz Luczak +4

Let D(G) be the smallest quantifier depth of a first order formula which is true for a graph G but false for any other non-isomorphic graph. This can be viewed as a measure for the…