activity
20012005
most citedDescriptive Complexity of Finite Structures: Saving the Quantifier Rank

1 citations · 2 across the 8 of their papers we have counts for

collaborators
Showing 2005 · math.COShow all

1 paper · 2 filters

math.CO2005

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…