On infinite spectra of first order properties of random graphs
Combinatorics
2016-09-06 v1
Abstract
In this paper, we study spectra of first order properties of Erdos-Renyi random graph. We proved that minimal quantifier depth of a formula with an infinite spectrum is either 4 or 5.
Cite
@article{arxiv.1609.01115,
title = {On infinite spectra of first order properties of random graphs},
author = {M. E. Zhukovskii},
journal= {arXiv preprint arXiv:1609.01115},
year = {2016}
}