Broere–Pilśniak's infinite edge motion conjecture

From papers

Let GG be a countable, connected graph. An automorphism moves infinitely many edges if it does not fix infinitely many edges of GG. A 22-edge colouring is distinguishing if the only automorphism preserving it is the identity. Infinite edge motion conjecture. If every non-trivial automorphism of GG moves infinitely many edges, then there is a distinguishing 22-edge colouring. The conjecture is the edge-colouring analogue of Tucker's infinite motion conjecture and does not require local finiteness; it is proved in this paper.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Florian Lehner, “Breaking graph symmetries by edge colourings”, arXiv:1604.08144 (2016).

Solutions 0

No solutions have been posted yet.