activity
20012024
most citedUntangling planar graphs from a specified vertex position - Hard cases

10 citations · 44 across the 41 of their papers we have counts for

collaborators
Showing 2005Show all

1 paper · 1 filter

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…