The first order convergence law fails for random perfect graphs

We consider first order expressible properties of random perfect graphs. That is, we pick a graph $G_n$ uniformly at random from all (labelled) perfect graphs on $n$ 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 $G_n$ satisfies it does not converge as $n\to\infty$.

[1]  James F. Lynch,et al.  Probabilities of sentences about very sparse random graphs , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[2]  J. Spencer The Strange Logic of Random Graphs , 2001 .

[3]  Gregory L. McColm,et al.  MSO zero-one laws on random labelled acyclic graphs , 2002, Discret. Math..

[4]  Marc Noy,et al.  Logical limit laws for minor-closed classes of graphs , 2018, J. Comb. Theory, Ser. B.

[5]  Hans Jürgen Prömel,et al.  Almost all Berge Graphs are Perfect , 1992, Comb. Probab. Comput..

[6]  Ph. G. Kolaitis,et al.  _{+1}-free graphs: asymptotic structure and a 0-1 law , 1987 .

[7]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[8]  J. Spencer,et al.  Zero-one laws for sparse random graphs , 1988 .

[9]  Edward A. Bender,et al.  Almost all chordal graphs split , 1985, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.