Bounded quantifier depth spectra for random graphs

J. H. Spencer, M. E. Zhukovskii

Research output: Contribution to journalArticlepeer-review


For which α there are first order graph statements A of given quantifier depth k such that a Zero-One law does not hold for the random graph G(n,p(n)) with p(n) at or near (there are two notions) n? A fairly complete description is given in both the near dense (α near zero) and near linear (α near one) cases.

Original languageEnglish (US)
Pages (from-to)1651-1664
Number of pages14
JournalDiscrete Mathematics
Issue number6
StatePublished - Jun 6 2016


  • First-order logic
  • Random graphs
  • Spectra
  • Zero-one laws

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Bounded quantifier depth spectra for random graphs'. Together they form a unique fingerprint.

Cite this