On countably saturated linear orders and certain class of countably saturated graphs

The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality c. We provide some examples of pairwise non-isomorphic countably saturated linear orders of cardinality c, under different set-theoretic assumptions. We give a new proof of the old theorem of Harzheim, that the class of countably saturated linear orders has a uniquely determined one-element basis. From our proof it follows that this minimal linear order is a Fraisse limit of certain Fraisse class. In particular, it is homogeneous with respect to countable subsets. Next we prove the existence and uniqueness of the uncountable version of the random graph. This graph is isomorphic to (H(omega 1), is an element of boolean OR (sic) where H(omega(1)) is the set of hereditarily countable sets, and two sets are connected if one of them is an element of the other. In the last section, an example of a prime countably saturated Boolean algebra is presented.