2016/04/27 by Florian Lehner, Lehner, Florian
Computer Science · Social Sciences · Mathematics · #Graph Labeling and Dimension Problems #Japanese History and Culture #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1604.08144
The distinguishing index D'(G) of a graph G is the least number of colours needed in an edge colouring which is not preserved by any non-trivial automorphism. Broere and Pilśniak conjectured that if every non-trivial automorphism of a countable graph G moves infinitely many edges, then D'(G) ≤ 2. We prove this conjecture.