3 citations · 8 across the 8 of their papers we have counts for
Showing 2005 · math.COShow all
2 papers · 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…
math.CO2005
Counting Connected Graphs Asymptotically
Remco van der Hofstad, Joel Spencer
We find the asymptotic number of connected graphs with vertices and edges when approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\e…