English

The first order convergence law fails for random perfect graphs

Combinatorics 2018-10-02 v2 Probability

Abstract

We consider first order expressible properties of random perfect graphs. That is, we pick a graph GnG_n uniformly at random from all (labelled) perfect graphs on nn vertices and consider the probability that it satisfies some graph property that can be expressed in the first order language of graphs. We show that there exists such a first order expressible property for which the probability that GnG_n satisfies it does not converge as nn\to\infty.

Keywords

Cite

@article{arxiv.1711.10975,
  title  = {The first order convergence law fails for random perfect graphs},
  author = {Tobias Müller and Marc Noy},
  journal= {arXiv preprint arXiv:1711.10975},
  year   = {2018}
}

Comments

11 pages. Minor corrections since last version

R2 v1 2026-06-22T23:01:12.690Z