Breaking graph symmetries by edge colourings
Abstract
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\'sniak conjectured that if every non-trivial automorphism of a countable graph G moves infinitely many edges, then D'(G) ≤ 2. We prove this conjecture.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.