Distinguishing number of countable homogeneous relational structures

zbMATH Open1215.05198arXiv0804.4019MaRDI QIDQ2380452FDOQ2380452

L. Nguyen Van Thé, Norbert Sauer, Claude Laflamme

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: The distinguishing number of a graph $G$ is the smallest positive integer $r$ such that $G$ has a labeling of its vertices with $r$ labels for which there is no non-trivial automorphism of $G$ preserving these labels. Albertson and Collins computed the distinguishing number for various finite graphs, and Imrich, Klavv{z}ar and Trofimov computed the distinguishing number of some infinite graphs, showing in particular that the Random Graph has distinguishing number 2. We compute the distinguishing number of various other finite and countable homogeneous structures, including undirected and directed graphs, and posets. We show that this number is in most cases two or infinite, and besides a few exceptions conjecture that this is so for all primitive homogeneous countable structures.

Full work available at URL: https://arxiv.org/abs/0804.4019

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Group actions on combinatorial structures (05E18)

Cited In (16)

• Extending precolorings to distinguish group actions
• Distinguishing numbers and distinguishing indices of oriented graphs
• Orbit equivalence and permutation groups defined by unordered relations.
• Nordhaus-Gaddum theorem for the distinguishing chromatic number
• On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
• A note on computable distinguishing colorings
• Orbit-equivalent infinite permutation groups.
• Distinguishing threshold of graphs
• Local finiteness, distinguishing numbers, and Tucker's conjecture
• Distinguishing geometric graphs
• Infinite motion and 2-distinguishability of graphs and groups
• Distinguishing graphs with intermediate growth
• On countable stable structures which are homogeneous for a finite relational language
• Distinguishing number of universal homogeneous Urysohn metric spaces
• Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
• Trees with distinguishing index equal distinguishing number plus one

This page was built for publication: Distinguishing number of countable homogeneous relational structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380452)