activity
19982005
most citedRandom subgraphs of finite graphs: III. The phase transition for the -cube

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

collaborators
Showing 2004 · math.LOShow all

1 paper · 2 filters

math.LO2004

Succinct Definitions in the First Order Theory of Graphs

Oleg Pikhurko, Joel Spencer, Oleg Verbitsky

We say that a first order sentence A defines a graph G if A is true on G but false on any graph non-isomorphic to G. Let L(G) (resp. D(G)) denote the minimum length (resp. quantifi…