Decomposable graphs and definitions with no quantifier alternationOleg Pikhurko; Joel Spencer; Oleg Verbitsky · 2007

Succinct definitions in the first order theory of graphsOleg Pikhurko; Joel Spencer; Oleg Verbitsky · 2006

Descriptive Complexity of Finite Structures: Saving the Quantifier RankOleg Pikhurko and Oleg Verbitsky · The Journal of Symbolic Logic · 2005

Descriptive complexity of finite structures: Saving the quantifier rankPikhurko, Oleg; Verbitsky, Oleg · The Journal of Symbolic Logic · 2005

How complex are random graphs in first order logic?Jeong Han Kim; Oleg Pikhurko; Joel H. Spencer; Oleg Verbitsky · 2005

The first order definability of graphs: Upper bounds for quantifier depthOleg Pikhurko; Helmut Veith; Oleg Verbitsky · 2006

First-Order Definability of Trees and Sparse Random GraphsBOHMAN, TOM; FRIEZE, ALAN; ŁUCZAK, TOMASZ; PIKHURKO, OLEG; SMYTH, CLIFFORD; SPENCER, JOEL; VERBITSKY, OLEG · Combinatorics, Probability and Computing · 2007

Trees are almost primeOleg Pikhurko · 2007