Apr 24, 2013 · We study properties of random 2-colourings of locally finite graphs and show that the stabiliser of such a colouring is almost surely nowhere ...
We study properties of random 2-colourings of locally finite graphs and show that the stabilizer of such a colouring is almost surely nowhere dense in Aut G and ...
Apr 24, 2013 · As it turns out, in all of the above examples a random colouring will be almost surely distinguishing which leads to the following conjecture.
We study properties of random 2-colourings of locally finite graphs and show that the stabiliser of such a colouring is almost surely nowhere dense in Aut G and ...
Sep 16, 2013 · A colouring of a graph G is called distinguishing if its stabilizer in Aut G is trivial. It has been conjectured that, if every automorphism ...
A colouring of a graph G is called distinguishing if its stabilizer in Aut G is trivial. It has been conjectured that, if every automorphism of a locally ...
Random colourings and automorphism breaking in locally finite graphs. F Lehner. Combinatorics, Probability and Computing 22 (6), 885-909, 2013. 11, 2013. A ...
F. Lehner. Random colorings and automorphism breaking in locally finite graphs. Combinatorics, Probability and Computing 22/6 (2013), 885-909. [Zbl], [MR], [doi] ...
Missing: Colourings | Show results with:Colourings
An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is ...
Random colorings and automorphism breaking in locally finite graphs Combinatorics, Probability and Computing, 22 (6), pp. 885 – 909, 2013. doi pdf. [4] ...