Work

Consistent random vertex-orderings of graphs

Year: 2025

Type: article

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.

Source: Journal of the European Mathematical Society

DOI: 10.4171/jems/1624

Authors: Paul N. Balister, Béla Bollobás, Svante Janson

Institutions: University of Oxford, University of Cambridge, University of Memphis, Uppsala University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: National Science Foundation, Microsoft Research, University of Cambridge, Knut och Alice Wallenbergs Stiftelse

Award: Random Geometric Graphs