Consistent random vertex-orderings of graphs
Abstract
Given a hereditary graph property P, consider distributions of random orderings of vertices of graphs G∈P that are preserved under isomorphisms and under taking induced subgraphs. We show that for many properties P the only such random orderings are uniform, and give some examples of non-uniform orderings when they exist.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.