Consistent random vertex-orderings of graphs
classification
🧮 math.PR
math.CO
keywords
mathcalorderingsrandomgraphsunderconsiderconsistentdistributions
read the original abstract
Given a hereditary graph property $\mathcal{P}$, consider distributions of random orderings of vertices of graphs $G\in\mathcal{P}$ that are preserved under isomorphisms and under taking induced subgraphs. We show that for many properties $\mathcal{P}$ the only such random orderings are uniform, and give some examples of non-uniform orderings when they exist.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.