Spectrum for first-order properties of random hypergraphs
Combinatorics
2019-08-06 v1
Abstract
The notion of spectrum of first-order properties introduced by J. Spencer for Erdos-Renyi random graph is considered in relation to random uniform hypergraphs. We study properties of spectrum for first-order formulae with bounded quantifier depth and estimate the values of minimum and maximum points of this spectrum. We also consider the set of limit points of the spectrum and give a bound for its minimum value.
Cite
@article{arxiv.1908.01074,
title = {Spectrum for first-order properties of random hypergraphs},
author = {Svetlana Popova},
journal= {arXiv preprint arXiv:1908.01074},
year = {2019}
}