Distinguishing number of countable homogeneous relational structures

MaRDI QIDQ2380452zbMATH OpenFDO

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

Publication date 26 March 2010

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

Full work available at URL https://arxiv.org/abs/0804.4019, https://eudml.org/doc/233006, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r20.html

IPFS 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)

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.

Review text

Summary: 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. In early work, \textit{M. O. Albertson} and \textit{K. L. Collins} [Electron. J. Comb. 3, No. 1, Research paper R18, 17 p. (1996); printed version J. Comb. 3, No. 1, 259--275 (1996; Zbl 0851.05088)] computed the distinguishing number for various finite graphs, and more recently \textit{W. Imrich}, \textit{S. Klavžar} and \textit{V. Trofimov} [Electron. J. Comb. 14, No. 1, Research paper R36, 12 p. (2007; Zbl 1124.05044)] 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.

Recommendations

• Distinguishing infinite graphs
• Distinguishing number and adjacency properties
• Distinguishing Cartesian products of countable graphs
• Distinguishing numbers for graphs and groups
• Distinguishability of infinite groups and graphs

Cited in

(18)

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

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)