A characterization of a topology on the countably infinite random graph (Q1862065)

Let \(M(G)\) denote the set of all maximal complete subgraphs of a graph \(G\) endowed with the topology generated by all sets of the form \(B(x)=\{K\in M(G):x\in K\}\) and \(A(x)=\{K\in M(G):x\notin K\}\) where \(x\) is a vertex of \(G\). Given a finite set of vertices \(\{x_{1},x_{2},\ldots x_{n}\}\) and a number \(p\) strictly between \(0\) and \(1\), the random graph \(G_{n,p}\) is defined to be the random variable which is obtained by assigning an edge between \(x_{i}\) and \(x_{j}\) with probability \(p\). The edge assignments are assumed to be mutually independent. It is also possible to define a countable infinite graph as a random variable which is obtained by doing the same thing starting with a countable infinite vertex set. If \(S_{p}\) stands for the space of such graphs, it is well-known that any two graphs in \(S_{p}\) are homeomorphic with probability one. The usual way of interpreting this result is the following: if we define the measure of any isomorphism class in \(S_{p}\) as the measure of the set of real numbers that correspond to all members of the given isomorphism class, then there is one isomorphism class, say \(C^{\star}\), of measure one, and all other isomorphism classes have measure zero. \textit{L. M. Friedler} and \textit{H. W. Martin} [Ann. New York. Acad. Sci. 767, 62-72 (1995; Zbl 0921.54036)] prove that the space of irrationals is a graph space; that is, there is a graph \(G\) such that the irrationals are homeomorphic to \(M(G)\). In the previous result, the graph \(G\) is chosen to be uncountable. The main result of the paper under review establishes that the graph \(G\) can be token countable. To be precise, the authors show: Let \(G\in C^{\star}\). Then \(M(G)\) is homeomorphic to the irrationals. In addition, the authors characterize the graphs in \(C^{\star}\) in the following way: Let \(G\in C^{\star}\). Then \(M(G)\) is homeomorphic to the interval \((0,1]\) with the dyadic Sorgenfrey topology (the topology which has as a base the intervals \((r,s]\) with \(r,s\) dyadic rational numbers). They also give a way of building a graph in \(C^{\star}\) by means of the concept of \(1\)-extendable subgraphs.