Local finiteness, distinguishing numbers, and Tucker's conjecture (Q888634)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6502805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local finiteness, distinguishing numbers, and Tucker's conjecture |
scientific article; zbMATH DE number 6502805 |
Statements
Local finiteness, distinguishing numbers, and Tucker's conjecture (English)
0 references
2 November 2015
0 references
Summary: A distinguishing colouring of a graph is a colouring of the vertex set such that no non-trivial automorphism preserves the colouring. Tucker conjectured that if every non-trivial automorphism of a locally finite graph moves infinitely many vertices, then there is a distinguishing 2-colouring. We show that the requirement of local finiteness is necessary by giving a non-locally finite graph for which no finite number of colours suffices.
0 references
distinguishing number
0 references
infinite graphs
0 references
0.893823504447937
0 references
0.8910325169563293
0 references
0.8025574088096619
0 references
0.799049973487854
0 references
