Consistent random vertex-orderings of graphs
Probability
2015-06-11 v1 Combinatorics
Abstract
Given a hereditary graph property , consider distributions of random orderings of vertices of graphs that are preserved under isomorphisms and under taking induced subgraphs. We show that for many properties the only such random orderings are uniform, and give some examples of non-uniform orderings when they exist.
Cite
@article{arxiv.1506.03343,
title = {Consistent random vertex-orderings of graphs},
author = {Paul Balister and Béla Bollobás and Svante Janson},
journal= {arXiv preprint arXiv:1506.03343},
year = {2015}
}