Distinguishing regular graphs from lists
Jakub Kwa\'sny, Marcin Stawiski

TL;DR
This paper proves that all sufficiently large connected regular graphs, including infinite ones, can be edge-colour distinguished from lists of size two, extending to certain infinite cardinalities.
Contribution
It establishes that every large connected regular graph admits a list edge colouring that is distinguishing, generalizing previous results to infinite and larger graphs.
Findings
All connected regular graphs of order at least 7 have a 2-list distinguishing edge colouring.
The result extends to regular graphs of fixed points in the aleph hierarchy.
The theorem applies to both finite and certain infinite regular graphs.
Abstract
An edge colouring of a graph is called distinguishing if there is no non-trivial automorphism which preserves it. We prove that every at most countable, finite or infinite, connected regular graph of order at least admits a distinguishing edge colouring from any set of lists of length . Furthermore, we show that the same holds for connected regular graphs of order where is a fixed point of the aleph hierarchy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Finite Group Theory Research · Rings, Modules, and Algebras
