Samenvatting
We consider first order expressible properties of random perfect graphs. That is, we pick a graph G(n) uniformly at random from all (labeled) 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 -> infinity.
Originele taal-2 | English |
---|---|
Pagina's (van-tot) | 717-727 |
Aantal pagina's | 11 |
Tijdschrift | Random structures & algorithms |
Volume | 53 |
Nummer van het tijdschrift | 4 |
DOI's | |
Status | Published - dec.-2018 |
Evenement | 18th International Conference on Random Structures and Algorithms - Gniezno, Poland Duur: 7-aug.-2017 → 11-aug.-2017 |