Uncountable graphs and invariant measures on the set of universal countable graphs

Abstract

We give new examples and describe the complete lists of all measures on the set of countable homogeneous universal graphs and Ksfree homogeneous universal graphs (for s ≥ 3) that are invariant with respect to the group of all permutations of the vertices. Such measures can be regarded as random graphs (respectively, random Ks-free graphs). The well-known… (More)
DOI: 10.1002/rsa.20309

Topics

Cite this paper

@article{Petrov2010UncountableGA, title={Uncountable graphs and invariant measures on the set of universal countable graphs}, author={Fedor Petrov and Anatoly Vershik}, journal={Random Struct. Algorithms}, year={2010}, volume={37}, pages={389-406} }